




def 			lowerCamelCase_		(       UpperCamelCase__				:      str      )     ->       List[Any]:





				"""simple docstring"""


				__lowerCamelCase		       =    len(UpperCamelCase__      )
				while cur > 1:
								# Find the maximum number in arr
								__lowerCamelCase		       =    arr.index(max(arr[0:cur]      )      )
								# Reverse from 0 to mi
								__lowerCamelCase		       =    arr[mi::-1] + arr[mi + 1 : len(UpperCamelCase__      )]
								# Reverse whole list
								__lowerCamelCase		       =    arr[cur - 1 :: -1] + arr[cur : len(UpperCamelCase__      )]
								cur -= 1
				return arr


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








from math import sqrt







def 			lowerCamelCase_		(       UpperCamelCase__				:      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(UpperCamelCase__      ) + 1      ) ,     6      ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True







def 			lowerCamelCase_		(       UpperCamelCase__				:      int = 1_0001      )     ->       int:





				"""simple docstring"""


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


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


