


def    a   (							A__							)	-> list:




      '''simple docstring'''

      if len(A__							) < 2:
            return collection

      def circle_sort_util(A__      ,    A__      ,    A__							) -> bool:
            SCREAMING_SNAKE_CASE__       :  Union[str, Any]						     =		False

            if low == high:
                  return swapped

            SCREAMING_SNAKE_CASE__       :  Tuple						     =		low
            SCREAMING_SNAKE_CASE__       :  Union[str, Any]						     =		high

            while left < right:
                  if collection[left] > collection[right]:
                        SCREAMING_SNAKE_CASE__     ,       SCREAMING_SNAKE_CASE__       :  List[Any]						     =		(
                            collection[right],
                            collection[left],
                        )
                        SCREAMING_SNAKE_CASE__       :  Optional[Any]						     =		True

                  left += 1
                  right -= 1

            if left == right and collection[left] > collection[right + 1]:
                  SCREAMING_SNAKE_CASE__     ,       SCREAMING_SNAKE_CASE__       :  Union[str, Any]						     =		(
                      collection[right + 1],
                      collection[left],
                  )

                  SCREAMING_SNAKE_CASE__       :  Optional[int]						     =		True

            SCREAMING_SNAKE_CASE__       :  str						     =		low + int((high - low) / 2							)
            SCREAMING_SNAKE_CASE__       :  Optional[Any]						     =		circle_sort_util(A__      ,    A__      ,    A__							)
            SCREAMING_SNAKE_CASE__       :  Dict						     =		circle_sort_util(A__      ,    mid + 1      ,    A__							)

            return swapped or left_swap or right_swap

      SCREAMING_SNAKE_CASE__       :  List[Any]						     =		True

      while is_not_sorted is True:
            SCREAMING_SNAKE_CASE__       :  Any						     =		circle_sort_util(A__      ,    0      ,    len(A__							) - 1							)

      return collection


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














def 		_a       ( a					:list					)				->     list:

 if len(a					) < 2:
  return collection

 def circle_sort_util(a					:list      ,				a					:int      ,				a					:int					) -> bool:
  a						    = False

  if low == high:
   return swapped

  a						    = low
  a						    = high

  while left < right:
   if collection[left] > collection[right]:
    a    ,	a						    = (
        collection[right],
        collection[left],
    )
    a						    = True

   left += 1
   right -= 1

  if left == right and collection[left] > collection[right + 1]:
   a    ,	a						    = (
       collection[right + 1],
       collection[left],
   )

   a						    = True

  a						    = low + int((high - low) / 2					)
  a						    = circle_sort_util(a      ,				a      ,				a					)
  a						    = circle_sort_util(a      ,				mid + 1      ,				a					)

  return swapped or left_swap or right_swap

 a						    = True

 while is_not_sorted is True:
  a						    = circle_sort_util(a      ,				0      ,				len(a					) - 1					)

 return collection


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


