def        __lowerCAmelCase      (	_A = 10       ):



							"""simple docstring"""


							if not isinstance(_A			,_A       ) or n < 0:
														raise ValueError("""Invalid input"""       )
							_lowercase					=						10**n
							_lowercase					=						28_433 * (pow(2			,7_830_457			,_A       )) + 1
							return str(number % modulus       )


if __name__ == "__main__":
				from doctest import testmod

				testmod()
				print(F'''{solution(10) = }''')




def    a      ( a	)     ->List[Any]:




			'''simple docstring'''


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


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