




def     _SCREAMING_SNAKE_CASE    (							lowercase			: Optional[int]  ):


      '''simple docstring'''



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


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









def     _SCREAMING_SNAKE_CASE    (							):


      '''simple docstring'''



      lowerCamelCase_	  =					0
      for i in range(1			,							10_01  ):
            total += i**i
      return str(lowercase  )[-10:]


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



