




'''simple docstring'''







import math





def 		snake_case_				(_a      :				Any	):






    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 		snake_case_				(_a      :				Dict = 1_0_0_0       ,  _a      :				int = 1_0_0_0	):
    UpperCAmelCase     			=						[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	):
                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))








from itertools import combinations_with_replacement






def 	lowerCamelCase_       (			_a = 100			):




		"""simple docstring"""






		lowerCAmelCase__  :     list[int]       	=   [*list(range(1      ,  21			)			), 25]
		lowerCAmelCase__  :     list[int]       	=   [2 * x for x in range(1      ,  21			)] + [50]
		lowerCAmelCase__  :     list[int]       	=   [3 * x for x in range(1      ,  21			)]
		lowerCAmelCase__  :     list[int]       	=   singles + doubles + triples + [0]

		lowerCAmelCase__  :     int       	=   0
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int

		for double in doubles:
				for throwa, throwa in combinations_with_replacement(_a      ,  2			):
						lowerCAmelCase__  :     Dict       	=   double + throwa + throwa
						if checkout_total < limit:
								num_checkouts += 1

		return num_checkouts


if __name__ == "__main__":
		print(f'''{solution() = }''')




