




"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Any = 1000000     )  ->     Any:
			__lowerCamelCase					:	Dict	       =				set(range(3							,				_lowercase							,				2     )     )
			primes.add(2     )
			for p in range(3							,				_lowercase							,				2     ):
						if p not in primes:
									continue
						primes.difference_update(set(range(p * p							,				_lowercase							,				_lowercase     )     )     )

			__lowerCamelCase					:	Optional[Any]	       =				[float(_lowercase     ) for n in range(limit + 1     )]

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

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


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









"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Dict     )  ->     Optional[int]:
			stooge(A__							,				0							,				len(A__     ) - 1     )
			return arr





def 						UpperCAmelCase				(			A__:    Dict							,				A__:    List[str]							,				A__:    Optional[int]     )  ->     Any:
			if i >= h:
						return

			# If first element is smaller than the last then swap them
			if arr[i] > arr[h]:
						__lowerCamelCase       ,      __lowerCamelCase					:	Dict	       =				arr[h], arr[i]

			# If there are more than 2 elements in the array
			if h - i + 1 > 2:
						__lowerCamelCase					:	str	       =				(int)((h - i + 1) / 3     )

						# Recursively sort first 2/3 elements
						stooge(A__							,				A__							,				(h - t)     )

						# Recursively sort last 2/3 elements
						stooge(A__							,				i + t							,				(A__)     )

						# Recursively sort first 2/3 elements
						stooge(A__							,				A__							,				(h - t)     )


if __name__ == "__main__":
					a_				:    Tuple										=     input('''Enter numbers separated by a comma:\n''').strip()
					a_				:    Optional[Any]										=     [int(item) for item in user_input.split(''',''')]
					print(stooge_sort(unsorted))



