

def      a      (			A__	:   List[str]     )    ->      List[Any]:





      """simple docstring"""



      _lowercase	       =len(UpperCamelCase__     )
      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(UpperCamelCase__     )]
            # Reverse whole list
            _lowercase	       =arr[cur - 1 :: -1] + arr[cur : len(UpperCamelCase__     )]
            cur -= 1
      return arr


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





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							if edge <= 0 or not isinstance(UpperCamelCase__   ,							UpperCamelCase__      ):
														raise ValueError('Length must be a positive.'      )
							return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							if edge <= 0 or not isinstance(UpperCamelCase__   ,							UpperCamelCase__      ):
														raise ValueError('Length must be a positive.'      )
							return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
					import doctest

					doctest.testmod()




