


import math


def 	_UpperCamelCase							(				lowercase__				):

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


def 	_UpperCamelCase							(				lowercase__ = 1000   ,	lowercase__ = 1000				):
						__SCREAMING_SNAKE_CASE						:					Optional[Any]		      =		[0, 0, 0]  # length, a, b
						for a in range((a_limit * -1) + 1   ,	lowercase__				):
												for b in range(2   ,	lowercase__				):
																		if is_prime(lowercase__				):
																								__SCREAMING_SNAKE_CASE						:					str		      =		0
																								__SCREAMING_SNAKE_CASE						:					Dict		      =		0
																								while is_prime((n**2) + (a * n) + b				):
																														count += 1
																														n += 1
																								if count > longest[0]:
																														__SCREAMING_SNAKE_CASE						:					Union[str, Any]		      =		[count, a, b]
						__SCREAMING_SNAKE_CASE						:					Optional[Any]		      =		longest[1] * longest[2]
						return ans


if __name__ == "__main__":
						print(solution(1_0_0_0, 1_0_0_0))




def 	_UpperCamelCase							(				lowercase__   ,	lowercase__				):
						__SCREAMING_SNAKE_CASE						:					int		      =		len(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					int		      =		len(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					int		      =		(
						    first_input_list_length
						    if first_input_list_length > second_input_list_length
						    else second_input_list_length
						)
						__SCREAMING_SNAKE_CASE						:					list		      =		[]
						for char_count in range(lowercase__				):
												if char_count < first_input_list_length:
																		output_result_list.append(first_input_list[char_count]				)
												if char_count < second_input_list_length:
																		output_result_list.append(second_input_list[char_count]				)

						return output_result_list


if __name__ == "__main__":
						print(alternative_list_arrange(['A', 'B', 'C'], [1, 2, 3, 4, 5]), end=' ')
