
def 						UpperCAmelCase			(	a_ = 1_0_0_0_0_0_0						)		->	int:







				"""simple docstring"""



				__A   			= [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 						UpperCAmelCase			(	a_						)		->	list:







				"""simple docstring"""



				if len(a_						) <= 1:
								return [tuple(a_						)]

				__A   			= []

				def generate(a_		,   a_						):
								if k == 1:
												res.append(tuple(arr[:]						)						)
												return

								generate(k - 1		,   a_						)

								for i in range(k - 1						):
												if k % 2 == 0:  # k is even
																__A			,							__A   			= arr[k - 1], arr[i]
												else:  # k is odd
																__A			,							__A   			= arr[k - 1], arr[0]
												generate(k - 1		,   a_						)

				generate(len(a_						)		,   a_						)
				return res


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE							:int							 =				input('Enter numbers separated by a comma:\n').strip()
					SCREAMING_SNAKE_CASE							:Dict							 =				[int(item) for item in user_input.split(',')]
					print(heaps(arr))
