


def 						a__			(				A__				):
			stooge(A__,      0,      len(A__				) - 1				)
			return arr






def 						a__			(				A__,      A__,      A__				):
			if i >= h:
						return

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

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

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

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

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


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









from __future__ import annotations






def 						a__			(				A__,      A__ = None,      A__ = None				):
			if start is None:
						SCREAMING_SNAKE_CASE_		:     List[str]					=					0

			if end is None:
						SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					len(A__				) - 1

			if start >= end:
						return

			SCREAMING_SNAKE_CASE_		:     Tuple					=					(start + end) // 2

			slowsort(A__,      A__,      A__				)
			slowsort(A__,      mid + 1,      A__				)

			if sequence[end] < sequence[mid]:
						SCREAMING_SNAKE_CASE_		,      SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					sequence[mid], sequence[end]

			slowsort(A__,      A__,      end - 1				)


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

				testmod()





