





'''simple docstring'''







def 		SCREAMING_SNAKE_CASE      (					lowerCAmelCase__     :	str):

     '''simple docstring'''




     _lowercase							:      Union[str, Any]  						=							len(lowerCAmelCase__)
     for _ in range(
         0       ,  int(((no_of_elements - 1) / 2) + 1)):  # we don't need to traverse to end of list as
          for j in range(0       ,  no_of_elements - 1):
               if (
                   lst[j + 1] < lst[j]
               ):  # applying bubble sort algorithm from left to right (or forwards)
                    _lowercase							:      Optional[int]  						=							lst[j + 1]
                    _lowercase							:      int  						=							lst[j]
                    _lowercase							:      List[Any]  						=							temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    _lowercase							:      List[Any]  						=							lst[no_of_elements - 1 - j]
                    _lowercase							:      Tuple  						=							lst[no_of_elements - 2 - j]
                    _lowercase							:      Optional[int]  						=							temp
     return lst


if __name__ == "__main__":
    print('''enter the list to be sorted''')
    A						    =							[int(x) for x in input().split()]  # inputing elements of the list in one line
    A						    =							double_sort(lst)
    print('''the sorted list is''')
    print(sorted_lst)






'''simple docstring'''







from __future__ import annotations

import math
import random

def 		SCREAMING_SNAKE_CASE      (					lowerCAmelCase__     :	int       ,  lowerCAmelCase__     :	int       ,  lowerCAmelCase__     :	int)			->						list[int]:

     '''simple docstring'''




     _lowercase							:      Optional[Any]  						=							d * e - 1
     _lowercase							:      Optional[Any]  						=							0
     _lowercase							:      Dict  						=							0
     while p == 0:
          _lowercase							:      Optional[Any]  						=							random.randint(2       ,  n - 1)
          _lowercase							:      int  						=							k
          while True:
               if t % 2 == 0:
                    _lowercase							:      int  						=							t // 2
                    _lowercase							:      Any  						=							(g**t) % n
                    _lowercase							:      Tuple  						=							math.gcd(x - 1       ,  lowerCAmelCase__)
                    if x > 1 and y > 1:
                         _lowercase							:      Union[str, Any]  						=							y
                         _lowercase							:      Dict  						=							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()