target=1500
d=[0]*target
n=2
while n < target:
    for i in range(n+n,target,n): d[i]+=1
    n=n+1
    while n < target and d[n]: n+=1
primeList=[n for n in range(2,target) if d[n]==0]

def isPrime(m):
    if m<=0: return False
    else:
        i=0
        while i < len(primeList) and primeList[i]*primeList[i]<=m and m%primeList[i]: i+=1
        return i>=len(primeList) or m%primeList[i]

maxCount=maxA=maxB=0
for b in primeList[:168]:
    for a in range(-1000,1001):
        n=0
        while isPrime(n*n+a*n+b): n+=1
        n-=1
        if n>maxCount:
            maxCount=n
            maxA=a
            maxB=b

print maxA*maxB, maxCount, maxA, maxB