





def 				__UpperCamelCase  (		snake_case     )  ->						List[Any]:


   '''simple docstring'''







   __A				 =       len(SCREAMING_SNAKE_CASE_     )
   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)
            __A				 =       lst[j + 1]
            __A				 =       lst[j]
            __A				 =       temp
         if (
             lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
         ):  # applying bubble sort algorithm from right to left (or backwards)
            __A				 =       lst[no_of_elements - 1 - j]
            __A				 =       lst[no_of_elements - 2 - j]
            __A				 =       temp
   return lst


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








from __future__ import annotations

import sys
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						tuple[int, int]:


   '''simple docstring'''







   if abs(snake_case     ) == 1:
      return a, 0
   elif abs(snake_case     ) == 1:
      return 0, b

   __A ,						__A				 =       a, b
   __A ,						__A				 =       1, 0
   __A ,						__A				 =       0, 1

   while remainder != 0:
      __A				 =       old_remainder // remainder
      __A ,						__A				 =       remainder, old_remainder - quotient * remainder
      __A ,						__A				 =       coeff_a, old_coeff_a - quotient * coeff_a
      __A ,						__A				 =       coeff_b, old_coeff_b - quotient * coeff_b

   # sign correction for negative numbers
   if a < 0:
      __A				 =       -old_coeff_a
   if b < 0:
      __A				 =       -old_coeff_b

   return old_coeff_a, old_coeff_b
def 				__UpperCamelCase  (		)  ->						Tuple:


   '''simple docstring'''







   if len(sys.argv     ) < 3:
      print('''2 integer arguments required'''     )
      return 1
   __A				 =       int(sys.argv[1]     )
   __A				 =       int(sys.argv[2]     )
   print(extended_euclidean_algorithm(snake_case    ,	snake_case     )     )
   return 0


if __name__ == "__main__":
    raise SystemExit(main())

