'''simple docstring'''

import math


def        UpperCAmelCase__   (				_lowerCAmelCase    :			int)    ->		List[Any]:



						"""simple docstring"""

						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        UpperCAmelCase__   (				_lowerCAmelCase    :			Union[str, Any] = 1000,      _lowerCAmelCase    :			Dict = 1000)    ->		List[Any]:



						"""simple docstring"""

						snake_case :       Dict				=    [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):
																								snake_case :       int				=    0
																								snake_case :       Tuple				=    0
																								while is_prime((n**2) + (a * n) + b):
																														count += 1
																														n += 1
																								if count > longest[0]:
																														snake_case :       Tuple				=    [count, a, b]
						snake_case :       List[str]				=    longest[1] * longest[2]
						return ans


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











"""simple docstring"""

def 		lowercase_   (		_UpperCAmelCase	,   _UpperCAmelCase						):




	"""simple docstring"""






	return a + b


if __name__ == "__main__":
		_lowerCamelCase	:      Tuple   =							5
		_lowerCamelCase	:      Union[str, Any]   =							6
		print(f'The sum of {a} + {b} is {add(a, b)}')





