"""simple docstring"""







def      __lowerCAmelCase(		__UpperCAmelCase = 600_851_475_143			):






	"""simple docstring"""





	try:
		_lowercase :    Tuple							=							int(__UpperCAmelCase			)
	except (TypeError, ValueError):
		raise TypeError('Parameter n must be int or castable to int.'			)
	if n <= 0:
		raise ValueError('Parameter n must be greater than or equal to one.'			)
	_lowercase :    List[Any]							=							1
	_lowercase :    List[str]							=							2
	while i * i <= n:
		while n % i == 0:
			_lowercase :    Optional[int]							=							i
			n //= i
		i += 1
	if n > 1:
		_lowercase :    Any							=							n
	return int(__UpperCAmelCase			)


if __name__ == "__main__":
						print(f"""{solution() = }""")







"""simple docstring"""







def      __lowerCAmelCase(		__UpperCAmelCase			):






	"""simple docstring"""





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


def      __lowerCAmelCase(		__UpperCAmelCase     ,__UpperCAmelCase     ,__UpperCAmelCase			):






	"""simple docstring"""





	if i >= h:
		return

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

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

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

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

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


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



