

'''simple docstring'''







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


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



'''simple docstring'''







def  UpperCAmelCase__      ( UpperCAmelCase__ = 10_00			)     ->     int:
       return sum(2 * a * ((a - 1) // 2) for a in range(3,    n + 1			)			)


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