





from __future__ import annotations

def     snake_case							(UpperCamelCase			:     str							):




	'''simple docstring'''







	lowerCamelCase__										=			str(UpperCamelCase							)
	return len(UpperCamelCase							) == 9 and set(UpperCamelCase							) == set("""123456789"""							)

def     snake_case							():




	'''simple docstring'''







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

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

	return None


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






'''simple docstring'''


from math import isqrt, loga
def 						lowerCamelCase__   (				a							):
						__snake_case						 =   [True] * max_number
						for i in range(2    ,	isqrt(max_number - 1							) + 1							):
												if is_prime[i]:
																		for j in range(i**2    ,	a    ,	a							):
																								__snake_case						 =   False

						return [i for i in range(2    ,	a							) if is_prime[i]]
def 						lowerCamelCase__   (				a = 800800    ,	a = 800800							):
						__snake_case						 =   degree * loga(a							)
						__snake_case						 =   int(a							)
						__snake_case						 =   calculate_prime_numbers(a							)

						__snake_case						 =   0
						__snake_case						 =   0
						__snake_case						 =   len(a							) - 1
						while left < right:
												while (
												    prime_numbers[right] * loga(prime_numbers[left]							)
												    + prime_numbers[left] * loga(prime_numbers[right]							)
												    > upper_bound
												):
																		right -= 1
												hybrid_integers_count += right - left
												left += 1

						return hybrid_integers_count


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

