




def 						lowerCamelCase__    (		_A = 2000000							):







	'''simple docstring'''





	snake_case_		    =     [0 for i in range(n + 1							)]
	snake_case_		    =     1
	snake_case_		    =     1

	for i in range(2     ,	int(n**0.5							) + 1							):
		if primality_list[i] == 0:
			for j in range(i * i     ,	n + 1     ,	_A							):
				snake_case_		    =     1
	snake_case_		    =     0
	for i in range(_A							):
		if primality_list[i] == 0:
			sum_of_primes += i
	return sum_of_primes


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() = }''')
