
def 						_snake_case(  SCREAMING_SNAKE_CASE__    )			->   Tuple:
       lowercase							:					str	     =					len(lowerCAmelCase__    )
       while cur > 1:
              # Find the maximum number in arr
              lowercase							:					Dict	     =					arr.index(max(arr[0:cur]    )    )
              # Reverse from 0 to mi
              lowercase							:					Tuple	     =					arr[mi::-1] + arr[mi + 1 : len(lowerCAmelCase__    )]
              # Reverse whole list
              lowercase							:					Optional[int]	     =					arr[cur - 1 :: -1] + arr[cur : len(lowerCAmelCase__    )]
              cur -= 1
       return arr


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


def 						_snake_case(  SCREAMING_SNAKE_CASE__    )			->   int:
       assert (
           isinstance(SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__    ) and number_of_steps > 0
       ), f"number_of_steps needs to be positive integer, your input {number_of_steps}"
       if number_of_steps == 1:
              return 1
       lowercase     ,      lowercase							:					Tuple	     =				1, 1
       for _ in range(number_of_steps - 1    ):
              lowercase     ,      lowercase							:					str	     =				current + previous, current
       return current


if __name__ == "__main__":
  import doctest

  doctest.testmod()
