


"""simple docstring"""


def      a__ (				__lowercase = 100_0000   )	->	int:
				_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     ,			snake_case__   ):
																phi[j] -= phi[j] // i

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


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










"""simple docstring"""


import random






def      a__ (				__lowercase     ,			__lowercase     ,			__lowercase   )	->	Optional[Any]:
				_A					  =			a[left_index]
				_A					  =			left_index + 1
				for j in range(left_index + 1     ,			__lowercase   ):
								if a[j] < pivot:
												_A  ,		_A					  =			a[i], a[j]
												i += 1
				_A  ,		_A					  =			a[i - 1], a[left_index]
				return i - 1






def      a__ (				__lowercase     ,			__lowercase     ,			__lowercase   )	->	int:
				if left < right:
								_A					  =			random.randint(__lowercase     ,			right - 1   )
								_A  ,		_A					  =			(
								    a[left],
								    a[pivot],
								)  # switches the pivot with the left most bound
								_A					  =			partition(__lowercase     ,			__lowercase     ,			__lowercase   )
								quick_sort_random(
								    __lowercase     ,			__lowercase     ,			__lowercase   )  # recursive quicksort to the left of the pivot point
								quick_sort_random(
								    __lowercase     ,			pivot_index + 1     ,			__lowercase   )  # recursive quicksort to the right of the pivot point






def      a__ (				)	->	Dict:
				_A					  =			input("Enter numbers separated by a comma:\n"   ).strip()
				_A					  =			[int(__lowercase   ) for item in user_input.split(","   )]

				quick_sort_random(__lowercase     ,			0     ,			len(__lowercase   )   )

				print(__lowercase   )


if __name__ == "__main__":
		main()