


from math import sqrt

def 			lowerCAmelCase__					(     a__:						int			)    ->						bool:


							'''simple docstring'''





							if 1 < number < 4:
														# 2 and 3 are primes
														return True
							elif number < 2 or number % 2 == 0 or number % 3 == 0:
														# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
														return False

							# All primes number are in format of 6k +/- 1
							for i in range(5     ,    int(sqrt(a__			) + 1			)     ,    6			):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True

def 			lowerCAmelCase__					(     a__:						int = 1_0_0_0_1			)    ->						int:


							'''simple docstring'''





							_UpperCAmelCase											=     0
							_UpperCAmelCase											=     1
							while count != nth and number < 3:
														number += 1
														if is_prime(a__			):
																					count += 1
							while count != nth:
														number += 2
														if is_prime(a__			):
																					count += 1
							return number


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




def 			lowerCAmelCase__					(     a__:						Optional[int]			)    ->						Optional[int]:


							'''simple docstring'''





							_UpperCAmelCase											=     len(a__			)
							for i in range(length - 1			):
														_UpperCAmelCase											=     i
														for k in range(i + 1     ,    a__			):
																					if collection[k] < collection[least]:
																												_UpperCAmelCase											=     k
														if least != i:
																					_UpperCAmelCase						,			_UpperCAmelCase											=     (collection[i], collection[least])
							return collection


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