





def lowerCAmelCase__(__snake_case = 1000000							)       ->   int:







	'''simple docstring'''







	lowerCamelCase__              =	set(range(3 ,__snake_case ,2							)							)
	primes.add(2							)
	for p in range(3 ,__snake_case ,2							):
		if p not in primes:
			continue
		primes.difference_update(set(range(p * p ,__snake_case ,__snake_case							)							)							)

	lowerCamelCase__              =	[float(__snake_case							) for n in range(limit + 1							)]

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

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


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










# This is the module that test_patching.py uses to test patch_submodule()

import os  # noqa: this is just for tests
import os as renamed_os  # noqa: this is just for tests
from os import path  # noqa: this is just for tests
from os import path as renamed_path  # noqa: this is just for tests
from os.path import join  # noqa: this is just for tests
from os.path import join as renamed_join  # noqa: this is just for tests


_a						=   open  # noqa: we just need to have a builtin inside this module to test it properly



