
'''simple docstring'''

def 	A  (   UpperCamelCase_       :  Any   )       ->							Dict:







			'''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__":
		UpperCAmelCase__ :			Any											=		input("Enter numbers separated by a comma:\n").strip()
		UpperCAmelCase__ :			Optional[Any]											=		[int(item) for item in user_input.split(",")]
		print(pancake_sort(unsorted))






'''simple docstring'''


def   A_      (       SCREAMING_SNAKE_CASE_						)			->bool:
  if number < 0:
    raise ValueError("""number must not be negative"""						)
  return number & (number - 1) == 0


if __name__ == "__main__":
       import doctest

       doctest.testmod()

