





def      _A       (		SCREAMING_SNAKE_CASE     :   list						):





  """simple docstring"""



  if any(not isinstance(SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE						) or x < 0 for x in sequence						):
    raise TypeError("Sequence must be list of non-negative integers"						)
  for _ in range(len(SCREAMING_SNAKE_CASE						)						):
    for i, (rod_upper, rod_lower) in enumerate(zip(SCREAMING_SNAKE_CASE       ,       sequence[1:]						)						):
      if rod_upper > rod_lower:
        sequence[i] -= rod_upper - rod_lower
        sequence[i + 1] += rod_upper - rod_lower
  return sequence


if __name__ == "__main__":
     assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
     assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]













def      _A       (		SCREAMING_SNAKE_CASE     :   Optional[Any]						):





  """simple docstring"""



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


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






