





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(UpperCamelCase_ ) + 1 )					,   6 ):
		if number % i == 0 or number % (i + 2) == 0:
			return False
	return True




def  A_(      A = 1000					,   A = 1000 ):
	UpperCAmelCase_		    =  [0, 0, 0]  # length, a, b
	for a in range((a_limit * -1) + 1					,   UpperCamelCase_ ):
		for b in range(2					,   UpperCamelCase_ ):
			if is_prime(UpperCamelCase_ ):
				UpperCAmelCase_		    =  0
				UpperCAmelCase_		    =  0
				while is_prime((n**2) + (a * n) + b ):
					count += 1
					n += 1
				if count > longest[0]:
					UpperCAmelCase_		    =  [count, a, b]
	UpperCAmelCase_		    =  longest[1] * longest[2]
	return ans


if __name__ == "__main__":
				print(solution(10_00, 10_00))










"""simple docstring"""


def 					a			(  UpperCamelCase_				:					float		)	->		int:
 return int(UpperCamelCase_		) if x - int(UpperCamelCase_		) <= 0 else int(UpperCamelCase_		) + 1


if __name__ == "__main__":
   import doctest

   doctest.testmod()





