



def 	snake_case__       (					__lowercase       )		->		Optional[int]:







      """simple docstring"""

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


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




def 	snake_case__       (					)		->		Union[str, Any]:







						"""simple docstring"""

						A__	:							Tuple						    = []
						A__	:							Optional[int]						    = 1

						while len(__lowercase       ) < 1E6:
												constant.append(str(__lowercase       )       )
												i += 1

						A__	:							Any						    = "".join(__lowercase       )

						return (
						    int(constant[0]       )
						    * int(constant[9]       )
						    * int(constant[9_9]       )
						    * int(constant[9_9_9]       )
						    * int(constant[9_9_9_9]       )
						    * int(constant[9_9_9_9_9]       )
						    * int(constant[9_9_9_9_9_9]       )
						)


if __name__ == "__main__":
		print(solution())