




from __future__ import annotations


def 						lowerCamelCase__    (		_A							):







	'''simple docstring'''





	snake_case_		    =     [True] * limit
	snake_case_		    =     False
	snake_case_		    =     False
	snake_case_		    =     True

	for i in range(3     ,	int(limit**0.5 + 1							)     ,	2							):
		snake_case_		    =     i * 2
		while index < limit:
			snake_case_		    =     False
			snake_case_		    =     index + i

	snake_case_		    =     [2]

	for i in range(3     ,	_A     ,	2							):
		if is_prime[i]:
			primes.append(_A							)

	return primes


def 						lowerCamelCase__    (		_A = 1000000							):







	'''simple docstring'''





	snake_case_		    =     prime_sieve(_A							)
	snake_case_		    =     0
	snake_case_		    =     0

	for i in range(len(_A							)							):
		for j in range(i + length     ,	len(_A							)							):
			snake_case_		    =     sum(primes[i:j]							)
			if sol >= ceiling:
				break

			if sol in primes:
				snake_case_		    =     j - i
				snake_case_		    =     sol

	return largest


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






from __future__ import annotations


def 						lowerCamelCase__    (		_A							):







	'''simple docstring'''





	snake_case_		    =     str(_A							)
	return len(_A							) == 9 and set(_A							) == set("123456789"							)


def 						lowerCamelCase__    (		):







	'''simple docstring'''





	for base_num in range(9999     ,	4999     ,	-1							):
		snake_case_		    =     100002 * base_num
		if is_9_pandigital(_A							):
			return candidate

	for base_num in range(333     ,	99     ,	-1							):
		snake_case_		    =     1002003 * base_num
		if is_9_pandigital(_A							):
			return candidate

	return None


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