


"""simple docstring"""



def   __lowerCAmelCase						(						lowercase  :  int			)     ->						int:


    """simple docstring"""





    snake_case   :				str				 =   len(SCREAMING_SNAKE_CASE_			)
    while cur > 1:
        # Find the maximum number in arr
        snake_case   :				Optional[Any]				 =   arr.index(max(arr[0:cur]			)			)
        # Reverse from 0 to mi
        snake_case   :				Tuple				 =   arr[mi::-1] + arr[mi + 1 : len(SCREAMING_SNAKE_CASE_			)]
        # Reverse whole list
        snake_case   :				Union[str, Any]				 =   arr[cur - 1 :: -1] + arr[cur : len(SCREAMING_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))









"""simple docstring"""



import math
import sys







def   __lowerCAmelCase						(						lowercase  :  int			)     ->						int:


    """simple docstring"""





    if number != int(lowercase			):
        raise ValueError("the value of input must be a natural number"			)
    if number < 0:
        raise ValueError("the value of input must not be a negative number"			)
    if number == 0:
        return 1
    snake_case   :				Optional[Any]				 =   [-1] * (number + 1)
    snake_case   :				str				 =   0
    for i in range(1						,							number + 1			):
        snake_case   :				List[Any]				 =   sys.maxsize
        snake_case   :				Union[str, Any]				 =   int(math.sqrt(lowercase			)			)
        for j in range(1						,							root + 1			):
            snake_case   :				List[str]				 =   1 + answers[i - (j**2)]
            snake_case   :				Optional[Any]				 =   min(lowercase						,							lowercase			)
        snake_case   :				Any				 =   answer
    return answers[number]


if __name__ == "__main__":
  import doctest

  doctest.testmod()





