





snake_case 				=       """Tobias Carryer"""

from time import time





class 				A_				:







							"""simple docstring"""





							def __init__(    self	:	Any						,__A	:	Tuple						,__A	:	Optional[int]						,__A	:	Dict						,__A	:	Any=int(time()  )  )						->					Union[str, Any]:  # noqa: B008
									_lowercase							= multiplier
									_lowercase							= increment
									_lowercase							= modulo
									_lowercase							= seed







							def    __UpperCAmelCase (    self	:	Tuple  )						->					Tuple:
									_lowercase							= (self.multiplier * self.seed + self.increment) % self.modulo
									return self.seed


if __name__ == "__main__":
						# Show the LCG in action.
						snake_case 				=       LinearCongruentialGenerator(1_6_6_4_5_2_5, 1_0_1_3_9_0_4_2_2_3, 2 << 3_1)
						while True:
												print(lcg.next_number())






def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :List[str]     )      ->						Dict:
  _lowercase							= len(snake_case__     )
  while cur > 1:
    # Find the maximum number in arr
    _lowercase							= arr.index(max(arr[0:cur]     )     )
    # Reverse from 0 to mi
    _lowercase							= arr[mi::-1] + arr[mi + 1 : len(snake_case__     )]
    # Reverse whole list
    _lowercase							= arr[cur - 1 :: -1] + arr[cur : len(snake_case__     )]
    cur -= 1
  return arr


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