



from functools import lru_cache
@lru_cache
def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						int					)->int:
      if not isinstance(_SCREAMING_SNAKE_CASE  ,					_SCREAMING_SNAKE_CASE					):
            raise TypeError('''k must be an integer.'''					)
      if k < 0:
            raise ValueError('''k integer must be greater or equal to zero.'''					)
      if k == 0:
            return 0
      elif k == 1:
            return 1
      else:
            return fibonacci(k - 1					) + fibonacci(k - 2					)
def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						list  ,					_SCREAMING_SNAKE_CASE :						int					)->int:
      _lowerCAmelCase			      =	len(_SCREAMING_SNAKE_CASE					)
      # Find m such that F_m >= n where F_i is the i_th fibonacci number.
      _lowerCAmelCase			      =	0
      while True:
            if fibonacci(_SCREAMING_SNAKE_CASE					) >= len_list:
                  _lowerCAmelCase			      =	i
                  break
            i += 1
      _lowerCAmelCase			      =	0
      while fibb_k > 0:
            _lowerCAmelCase			      =	min(
                offset + fibonacci(fibb_k - 1					)  ,					len_list - 1					)  # Prevent out of range
            _lowerCAmelCase			      =	arr[index_k]
            if item_k_1 == val:
                  return index_k
            elif val < item_k_1:
                  fibb_k -= 1
            elif val > item_k_1:
                  offset += fibonacci(fibb_k - 1					)
                  fibb_k -= 2
      else:
            return -1


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))