from __future__ import annotations





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_       ,				UpperCamelCase_					)		->  int:







 '''simple docstring'''
 assert n > 1 and a > 0 and greatest_common_divisor(UpperCamelCase_       ,				UpperCamelCase_					) == 1
 (UpperCamelCase)      =			extended_gcd(UpperCamelCase_       ,				UpperCamelCase_					)  # Implemented below
 UpperCamelCase      =			(b * s) % n
 return x





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_					)		->  Any:







 '''simple docstring'''
 (UpperCamelCase)      =			extended_euclid(UpperCamelCase_       ,				UpperCamelCase_					)  # Implemented below
 if b < 0:
  UpperCamelCase      =			(b % n + n) % n
 return b





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_       ,				UpperCamelCase_					)		->  Dict:







 '''simple docstring'''
 UpperCamelCase      =			invert_modulo(UpperCamelCase_       ,				UpperCamelCase_					)
 UpperCamelCase      =			(b * s) % n
 return x





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_					)		->  Dict:







 '''simple docstring'''
 assert a >= 0 and b >= 0

 if b == 0:
  UpperCamelCase      =			a, 1, 0
 else:
  (UpperCamelCase)      =			extended_gcd(UpperCamelCase_       ,				a % b					)
  UpperCamelCase      =			q
  UpperCamelCase      =			p - q * (a // b)

 assert a % d == 0 and b % d == 0
 assert d == a * x + b * y

 return (d, x, y)





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_					)		->  str:







 '''simple docstring'''
 if b == 0:
  return (1, 0)
 (UpperCamelCase)      =			extended_euclid(UpperCamelCase_       ,				a % b					)
 UpperCamelCase      =			a // b
 return (y, x - k * y)





def  lowercase(  UpperCamelCase_       ,				UpperCamelCase_					)		->  str:







 '''simple docstring'''
 if a < b:
  UpperCamelCase      =			b, a

 while a % b != 0:
  UpperCamelCase      =			b, a % b

 return b


if __name__ == "__main__":
     from doctest import testmod

     testmod(name="""modular_division""", verbose=True)
     testmod(name="""modular_division2""", verbose=True)
     testmod(name="""invert_modulo""", verbose=True)
     testmod(name="""extended_gcd""", verbose=True)
     testmod(name="""extended_euclid""", verbose=True)
     testmod(name="""greatest_common_divisor""", verbose=True)

def  lowercase(  UpperCamelCase_					)		->  Optional[int]:







 '''simple docstring'''
 UpperCamelCase      =			len(UpperCamelCase_					)
 for i in range(length - 1					):
  UpperCamelCase      =			False
  for j in range(length - 1 - i					):
   if collection[j] > collection[j + 1]:
    UpperCamelCase      =			True
    UpperCamelCase     ,    UpperCamelCase      =			collection[j + 1], collection[j]
  if not swapped:
   break  # Stop iteration if the collection is sorted.
 return collection


if __name__ == "__main__":
     import doctest
     import time

     doctest.testmod()

     _SCREAMING_SNAKE_CASE   		=			input("""Enter numbers separated by a comma:""").strip()
     _SCREAMING_SNAKE_CASE   		=			[int(item) for item in user_input.split(""",""")]
     _SCREAMING_SNAKE_CASE   		=			time.process_time()
     print(*bubble_sort(unsorted), sep=""",""")
     print(F'''Processing time: {(time.process_time() - start)%1E9 + 7}''')
