


'''simple docstring'''

def 							__magic_name__(						lowerCamelCase = 2_0_0_0_0_0_0):
						__lowerCAmelCase							       =				[0 for i in range(n + 1)]
						__lowerCAmelCase							       =				1
						__lowerCAmelCase							       =				1

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


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







'''simple docstring'''

def 							__magic_name__(						):
						return [
						    a * b * (1_0_0_0 - a - b)
						    for a in range(1,				9_9_9)
						    for b in range(lowerCamelCase,				9_9_9)
						    if (a * a + b * b == (1_0_0_0 - a - b) ** 2)
						][0]


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

