



def      __lowercase       (			a__ = 1_00_00_00       )    ->			int:
							__SCREAMING_SNAKE_CASE									= [i - 1 for i in range(limit + 1       )]

							for i in range(2							,       limit + 1       ):
														if phi[i] == i - 1:
																					for j in range(2 * i							,       limit + 1							,       a__       ):
																												phi[j] -= phi[j] // i

							return sum(phi[2 : limit + 1]       )


if __name__ == "__main__":
			print(solution())











def      __lowercase       (			a__ = 10_00       )    ->			int:
							__SCREAMING_SNAKE_CASE									= -1
							__SCREAMING_SNAKE_CASE									= 0
							for a in range(1							,       n // 3       ):
														# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
														__SCREAMING_SNAKE_CASE									= (n * n - 2 * a * n) // (2 * n - 2 * a)
														__SCREAMING_SNAKE_CASE									= n - a - b
														if c * c == (a * a + b * b):
																					__SCREAMING_SNAKE_CASE									= a * b * c
																					if candidate >= product:
																												__SCREAMING_SNAKE_CASE									= candidate
							return product


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






