



def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						int  ,					_SCREAMING_SNAKE_CASE :						int = 1_0_0_0					)->str:
      if (not isinstance(_SCREAMING_SNAKE_CASE  ,					_SCREAMING_SNAKE_CASE					)) or (digit_position <= 0):
            raise ValueError('''Digit position must be a positive integer'''					)
      elif (not isinstance(_SCREAMING_SNAKE_CASE  ,					_SCREAMING_SNAKE_CASE					)) or (precision < 0):
            raise ValueError('''Precision must be a nonnegative integer'''					)

      # compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
      # accurate
      _lowerCAmelCase			      =	(
          4 * _subsum(_SCREAMING_SNAKE_CASE  ,					1  ,					_SCREAMING_SNAKE_CASE					)
          - 2 * _subsum(_SCREAMING_SNAKE_CASE  ,					4  ,					_SCREAMING_SNAKE_CASE					)
          - _subsum(_SCREAMING_SNAKE_CASE  ,					5  ,					_SCREAMING_SNAKE_CASE					)
          - _subsum(_SCREAMING_SNAKE_CASE  ,					6  ,					_SCREAMING_SNAKE_CASE					)
      )

      # return the first hex digit of the fractional part of the result
      return hex(int((sum_result % 1) * 1_6					)					)[2:]
def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						int  ,					_SCREAMING_SNAKE_CASE :						int  ,					_SCREAMING_SNAKE_CASE :						int					)->float:
      _lowerCAmelCase			      =	0.0
      for sum_index in range(digit_pos_to_extract + precision					):
            _lowerCAmelCase			      =	8 * sum_index + denominator_addend
            if sum_index < digit_pos_to_extract:
                  # if the exponential term is an integer and we mod it by the denominator
                  # before dividing, only the integer part of the sum will change;
                  # the fractional part will not
                  _lowerCAmelCase			      =	pow(
                      1_6  ,					digit_pos_to_extract - 1 - sum_index  ,					_SCREAMING_SNAKE_CASE					)
            else:
                  _lowerCAmelCase			      =	pow(1_6  ,					digit_pos_to_extract - 1 - sum_index					)
            total += exponential_term / denominator
      return total


if __name__ == "__main__":
    import doctest

    doctest.testmod()




from __future__ import annotations

from random import randrange
def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						list					)->list:
      if len(_SCREAMING_SNAKE_CASE					) < 2:
            return collection
      _lowerCAmelCase			      =	randrange(len(_SCREAMING_SNAKE_CASE					)					)  # Use random element as pivot
      _lowerCAmelCase			      =	collection[pivot_index]
      _lowerCAmelCase			      =	[]  # All elements greater than pivot
      _lowerCAmelCase			      =	[]  # 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__":
    UpperCAmelCase_          =				input("Enter numbers separated by a comma:\n").strip()
    UpperCAmelCase_          =				[int(item) for item in user_input.split(",")]
    print(quick_sort(unsorted))