



"""simple docstring"""
def   A_    (     _lowercase,   _lowercase,   _lowercase,   _lowercase,   _lowercase      ):







						'''simple docstring'''


						if target == 0:
												answer.append(path.copy()      )
						else:
												for index in range(_lowercase,   len(_lowercase      )      ):
																		if target >= candidates[index]:
																								path.append(candidates[index]      )
																								backtrack(_lowercase,   _lowercase,   _lowercase,   target - candidates[index],   _lowercase      )
																								path.pop(len(_lowercase      ) - 1      )
def   A_    (     _lowercase,   _lowercase      ):







						'''simple docstring'''


						snake_case_					:Optional[Any]		=     []  # type: list[int]
						snake_case_					:str		=     []  # type: list[int]
						backtrack(_lowercase,   _lowercase,   _lowercase,   _lowercase,   0      )
						return answer
def   A_    (     ):







						'''simple docstring'''


						print(combination_sum([-8, 2.3, 0],   1      )      )


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						main()




import math






def 	lowerCamelCase_       (			_a			):




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






def 	lowerCamelCase_       (			_a = 1_000      ,  _a = 1_000			):




		"""simple docstring"""






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


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




