'''simple docstring'''





def       lowerCAmelCase_							(   snake_case_			:					Dict     )       -> Union[str, Any]:


     '''simple docstring'''




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





def       lowerCAmelCase_							(   snake_case_			:					Optional[int]   ,       snake_case_			:					Dict   ,       snake_case_			:					str     )       -> Tuple:


     '''simple docstring'''




     if i >= h:
          return

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

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

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

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

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


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








def 						_lowerCAmelCase							(     _lowerCAmelCase			)    ->						int:


						'''simple docstring'''






						assert column_title.isupper()
						__snake_case				=		0
						__snake_case				=		len(_lowerCAmelCase			) - 1
						__snake_case				=		0

						while index >= 0:
												__snake_case				=		(ord(column_title[index]			) - 64) * pow(26   ,						_lowerCAmelCase			)
												answer += value
												power += 1
												index -= 1

						return answer


if __name__ == "__main__":
	from doctest import testmod

	testmod()





