'''simple docstring'''


def  _lowerCamelCase   (				lowerCamelCase_ :							Dict       ):



     """simple docstring"""





     stooge(lowerCamelCase_     ,					0     ,					len(lowerCamelCase_       ) - 1       )
     return arr


def  _lowerCamelCase   (				lowerCamelCase_ :							Optional[int]     ,					lowerCamelCase_ :							Optional[Any]     ,					lowerCamelCase_ :							Optional[Any]       ):



     """simple docstring"""





     if i >= h:
          return

     # If first element is smaller than the last then swap them
     if arr[i] > arr[h]:
          UpperCAmelCase_							:       Optional[Any]       =				arr[h], arr[i]

     # If there are more than 2 elements in the array
     if h - i + 1 > 2:
          UpperCAmelCase_							:       List[Any]       =				(int)((h - i + 1) / 3       )

          # Recursively sort first 2/3 elements
          stooge(lowerCamelCase_     ,					lowerCamelCase_     ,					(h - t)       )

          # Recursively sort last 2/3 elements
          stooge(lowerCamelCase_     ,					i + t     ,					(lowerCamelCase_)       )

          # Recursively sort first 2/3 elements
          stooge(lowerCamelCase_     ,					lowerCamelCase_     ,					(h - t)       )


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







'''simple docstring'''


snake_case__					:      str				      =  '''Tobias Carryer'''

from time import time






class 					__SCREAMING_SNAKE_CASE						:







  '''simple docstring'''






  def __init__(			self				,		snake_case_				,		snake_case_				,		snake_case_				,		snake_case_=int(time()						)						):  # noqa: B008




       '''simple docstring'''

       UpperCAmelCase_							:       str       =				multiplier
       UpperCAmelCase_							:       Dict       =				increment
       UpperCAmelCase_							:       Tuple       =				modulo
       UpperCAmelCase_							:       Dict       =				seed






  def _UpperCamelCase					(			self						):




       '''simple docstring'''

       UpperCAmelCase_							:       Union[str, Any]       =				(self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 snake_case__					:      Any				      =  LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
 while True:
  print(lcg.next_number())






