





from __future__ import annotations

from random import randrange







def 			_SCREAMING_SNAKE_CASE    (       a  )				->				list:
     if len(a  ) < 2:
          return collection
     __A     :						Tuple          =    randrange(len(a  )  )  # Use random element as pivot
     __A     :						Any          =    collection[pivot_index]
     __A     :						list[int]          =    []  # All elements greater than pivot
     __A     :						list[int]          =    []  # All elements less than or equal to pivot

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

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

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


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











from __future__ import annotations

import math
import random







def 			_SCREAMING_SNAKE_CASE    (       a ,						a ,						a  )				->				list[int]:
					__A     :						int          =    d * e - 1
					__A     :						List[str]          =    0
					__A     :						Optional[Any]          =    0
					while p == 0:
										__A     :						List[Any]          =    random.randint(2 ,						n - 1  )
										__A     :						Optional[int]          =    k
										while True:
															if t % 2 == 0:
																				__A     :						Tuple          =    t // 2
																				__A     :						List[str]          =    (g**t) % n
																				__A     :						List[Any]          =    math.gcd(x - 1 ,						a  )
																				if x > 1 and y > 1:
																									__A     :						List[str]          =    y
																									__A     :						str          =    n // y
																									break  # find the correct factors
															else:
																				break  # t is not divisible by 2, break and choose another g
					return sorted([p, q]  )


if __name__ == "__main__":
				import doctest

				doctest.testmod()




