



'''simple docstring'''



from __future__ import annotations

from collections import Counter



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	__lowerCAmelCase       				=	[True] * n
	__lowerCAmelCase       				=	False
	__lowerCAmelCase       				=	False
	__lowerCAmelCase       				=	True

	for i in range(3					,		int(n**0.5 + 1       )					,		2       ):
		__lowerCAmelCase       				=	i * 2
		while index < n:
			__lowerCAmelCase       				=	False
			__lowerCAmelCase       				=	index + i

	__lowerCAmelCase       				=	[2]

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

	return primes



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	__lowerCAmelCase       				=	str(lowerCamelCase       )
	__lowerCAmelCase       				=	[]
	__lowerCAmelCase       				=	["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"]

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

	return replacements



def 	__lowerCAmelCase       (				lowerCamelCase :    int = 8       ):






	'''simple docstring'''




	__lowerCAmelCase       				=	set()

	# Filter primes with less than 3 replaceable digits
	__lowerCAmelCase       				=	{
	    x for x in set(prime_sieve(1_00_00_00       )       ) if len(str(lowerCamelCase       )       ) - len(set(str(lowerCamelCase       )       )       ) >= 3
	}

	for prime in primes:
		if prime in numbers_checked:
			continue

		__lowerCAmelCase       				=	digit_replacements(lowerCamelCase       )

		for family in replacements:
			numbers_checked.update(lowerCamelCase       )
			__lowerCAmelCase       				=	primes.intersection(lowerCamelCase       )

			if len(lowerCamelCase       ) != family_length:
				continue

			return min(lowerCamelCase       )

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