



'''simple docstring'''



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	__lowerCAmelCase       				=	[True for i in range(n + 1       )]
	__lowerCAmelCase       				=	[i - 1 for i in range(n + 1       )]
	__lowerCAmelCase       				=	[]
	for i in range(2					,		n + 1       ):
		if is_prime[i]:
			primes.append(lowerCamelCase       )
		for j in range(0					,		len(lowerCamelCase       )       ):
			if i * primes[j] >= n:
				break
			__lowerCAmelCase       				=	False

			if i % primes[j] == 0:
				__lowerCAmelCase       				=	totients[i] * primes[j]
				break

			__lowerCAmelCase       				=	totients[i] * (primes[j] - 1)

	return totients


if __name__ == "__main__":
	import doctest

	doctest.testmod()




'''simple docstring'''



from __future__ import annotations

from random import randrange



def 	__lowerCAmelCase       (				lowerCamelCase :    list       ):






	'''simple docstring'''




	if len(lowerCamelCase       ) < 2:
		return collection
	__lowerCAmelCase       				=	randrange(len(lowerCamelCase       )       )  # Use random element as pivot
	__lowerCAmelCase       				=	collection[pivot_index]
	__lowerCAmelCase       				=	[]  # All elements greater than pivot
	__lowerCAmelCase       				=	[]  # All elements less than or equal to pivot

	for element in collection[:pivot_index]:
		(greater if element > pivot else lesser).append(lowerCamelCase       )

	for element in collection[pivot_index + 1 :]:
		(greater if element > pivot else lesser).append(lowerCamelCase       )

	return [*quick_sort(lowerCamelCase       ), pivot, *quick_sort(lowerCamelCase       )]


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