






import math
def    a__    (	A       ):

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5		,					int(math.sqrt(A       ) + 1       )		,					6       ):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True
def    a__    (	A = 1_000		,					A = 1_000       ):
   lowercase__    :						Optional[Any]       =			[0, 0, 0]  # length, a, b
   for a in range((a_limit * -1) + 1		,					A       ):
      for b in range(2		,					A       ):
         if is_prime(A       ):
            lowercase__    :						Dict       =			0
            lowercase__    :						Dict       =			0
            while is_prime((n**2) + (a * n) + b       ):
               count += 1
               n += 1
            if count > longest[0]:
               lowercase__    :						Dict       =			[count, a, b]
   lowercase__    :						Union[str, Any]       =			longest[1] * longest[2]
   return ans


if __name__ == "__main__":
 print(solution(1000, 1000))










def    a__    (	A       ):
   return " ".join([word[::-1] for word in input_str.split()]       )


if __name__ == "__main__":
 import doctest

 doctest.testmod()


