



'''simple docstring'''







from __future__ import annotations

from collections import Counter







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE     ):
		SCREAMING_SNAKE_CASE_						:Tuple										=      [True] * n
		SCREAMING_SNAKE_CASE_						:int										=      False
		SCREAMING_SNAKE_CASE_						:List[str]										=      False
		SCREAMING_SNAKE_CASE_						:List[str]										=      True

		for i in range(3 ,		int(n**0.5 + 1     ) ,		2     ):
				SCREAMING_SNAKE_CASE_						:Tuple										=      i * 2
				while index < n:
						SCREAMING_SNAKE_CASE_						:Dict										=      False
						SCREAMING_SNAKE_CASE_						:List[Any]										=      index + i

		SCREAMING_SNAKE_CASE_						:Tuple										=      [2]

		for i in range(3 ,		SCREAMING_SNAKE_CASE ,		2     ):
				if is_prime[i]:
						primes.append(SCREAMING_SNAKE_CASE     )

		return primes







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE     ):
		SCREAMING_SNAKE_CASE_						:Optional[int]										=      str(SCREAMING_SNAKE_CASE     )
		SCREAMING_SNAKE_CASE_						:str										=      []
		SCREAMING_SNAKE_CASE_						:Any										=      ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']

		for duplicate in Counter(SCREAMING_SNAKE_CASE     ) - Counter(set(SCREAMING_SNAKE_CASE     )     ):
				SCREAMING_SNAKE_CASE_						:int										=      [int(number_str.replace(SCREAMING_SNAKE_CASE ,		SCREAMING_SNAKE_CASE     )     ) for digit in digits]
				replacements.append(SCREAMING_SNAKE_CASE     )

		return replacements







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE = 8     ):
		SCREAMING_SNAKE_CASE_						:Optional[int]										=      set()

		# Filter primes with less than 3 replaceable digits
		SCREAMING_SNAKE_CASE_						:Optional[Any]										=      {
		    x for x in set(prime_sieve(100_0000     )     ) if len(str(SCREAMING_SNAKE_CASE     )     ) - len(set(str(SCREAMING_SNAKE_CASE     )     )     ) >= 3
		}

		for prime in primes:
				if prime in numbers_checked:
						continue

				SCREAMING_SNAKE_CASE_						:List[str]										=      digit_replacements(SCREAMING_SNAKE_CASE     )

				for family in replacements:
						numbers_checked.update(SCREAMING_SNAKE_CASE     )
						SCREAMING_SNAKE_CASE_						:int										=      primes.intersection(SCREAMING_SNAKE_CASE     )

						if len(SCREAMING_SNAKE_CASE     ) != family_length:
								continue

						return min(SCREAMING_SNAKE_CASE     )

		return -1


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





'''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))