

from __future__ import annotations



def 			_A	(      SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      ):
	if partitions <= 0:
		raise ValueError("partitions must be a positive number!"      )
	if partitions > number_of_bytes:
		raise ValueError("partitions can not > number_of_bytes!"      )
	UpperCAmelCase__:	Optional[int]									= number_of_bytes // partitions
	UpperCAmelCase__:	str									= []
	for i in range(SCREAMING_SNAKE_CASE      ):
		UpperCAmelCase__:	Dict									= i * bytes_per_partition + 1
		UpperCAmelCase__:	Union[str, Any]									= (
		    number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
		)
		allocation_list.append(f"{start_bytes}-{end_bytes}"      )
	return allocation_list


if __name__ == "__main__":
					import doctest

					doctest.testmod()


def 			_A	(      SCREAMING_SNAKE_CASE      ):
	stooge(SCREAMING_SNAKE_CASE	,0	,len(SCREAMING_SNAKE_CASE      ) - 1      )
	return arr



def 			_A	(      SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE	,SCREAMING_SNAKE_CASE      ):
	if i >= h:
		return

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

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

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

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

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


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