


'''simple docstring'''



def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       int = 1_000_000       ):
					__a      :	Any    =  set(range(3						,				_SCREAMING_SNAKE_CASE						,				2       )       )
					primes.add(2       )
					for p in range(3						,				_SCREAMING_SNAKE_CASE						,				2       ):
										if p not in primes:
															continue
										primes.difference_update(set(range(p * p						,				_SCREAMING_SNAKE_CASE						,				_SCREAMING_SNAKE_CASE       )       )       )

					__a      :	Tuple    =  [float(_SCREAMING_SNAKE_CASE       ) for n in range(limit + 1       )]

					for p in primes:
										for n in range(_SCREAMING_SNAKE_CASE						,				limit + 1						,				_SCREAMING_SNAKE_CASE       ):
															phi[n] *= 1 - 1 / p

					return int(sum(phi[2:]       )       )


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







'''simple docstring'''



def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       int       ):
					return number & 1 == 0


if __name__ == "__main__":
	import doctest

	doctest.testmod()



