

def   __SCREAMING_SNAKE_CASE (SCREAMING_SNAKE_CASE__	):
						if len(SCREAMING_SNAKE_CASE__	) > 1:
												snake_case_       =     len(SCREAMING_SNAKE_CASE__	) // 2  # Finds the middle of the array
												snake_case_       =     arr[
												    :middle_length
												]  # Creates an array of the elements in the first half.
												snake_case_       =     arr[
												    middle_length:
												]  # Creates an array of the elements in the second half.
												snake_case_       =     len(SCREAMING_SNAKE_CASE__	)
												snake_case_       =     len(SCREAMING_SNAKE_CASE__	)
												merge(SCREAMING_SNAKE_CASE__	)  # Starts sorting the left.
												merge(SCREAMING_SNAKE_CASE__	)  # Starts sorting the right
												snake_case_       =     0  # Left Counter
												snake_case_       =     0  # Right Counter
												snake_case_       =     0  # Position Counter
												while (
												    left_index < left_size and right_index < right_size
												):  # Runs until the lowers size of the left and right are sorted.
																		if left_array[left_index] < right_array[right_index]:
																								snake_case_       =     left_array[left_index]
																								left_index += 1
																		else:
																								snake_case_       =     right_array[right_index]
																								right_index += 1
																		index += 1
												while (
												    left_index < left_size
												):  # Adds the left over elements in the left half of the array
																		snake_case_       =     left_array[left_index]
																		left_index += 1
																		index += 1
												while (
												    right_index < right_size
												):  # Adds the left over elements in the right half of the array
																		snake_case_       =     right_array[right_index]
																		right_index += 1
																		index += 1
						return arr


if __name__ == "__main__":
					import doctest

					doctest.testmod()


from __future__ import annotations

from random import randrange


def   __SCREAMING_SNAKE_CASE (SCREAMING_SNAKE_CASE__	):
						if len(SCREAMING_SNAKE_CASE__	) < 2:
												return collection
						snake_case_       =     randrange(len(SCREAMING_SNAKE_CASE__	)	)  # Use random element as pivot
						snake_case_       =     collection[pivot_index]
						snake_case_       =     []  # All elements greater than pivot
						snake_case_       =     []  # All elements less than or equal to pivot

						for element in collection[:pivot_index]:
												(greater if element > pivot else lesser).append(SCREAMING_SNAKE_CASE__	)

						for element in collection[pivot_index + 1 :]:
												(greater if element > pivot else lesser).append(SCREAMING_SNAKE_CASE__	)

						return [*quick_sort(SCREAMING_SNAKE_CASE__	), pivot, *quick_sort(SCREAMING_SNAKE_CASE__	)]


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