



'''simple docstring'''





def __lowerCAmelCase (     SCREAMING_SNAKE_CASE_						,  SCREAMING_SNAKE_CASE_						,  SCREAMING_SNAKE_CASE_  ):
			if n == 0:
						return 1

			elif n % 2 == 1:
						return (binary_exponentiation(_lowerCAmelCase						,  n - 1						,  _lowerCAmelCase  ) * a) % mod

			else:
						lowercase__					  =				binary_exponentiation(_lowerCAmelCase						,  n / 2						,  _lowerCAmelCase  )
						return (b * b) % mod


# a prime number
lowercase_								=     701

lowercase_								=     10_0000_0000
lowercase_								=     10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)




print((a / b) % p == (a * b ** (p - 2)) % p)









def __lowerCAmelCase (     SCREAMING_SNAKE_CASE_  ):
			lowercase__					  =				len(SCREAMING_SNAKE_CASE_  )
			for i in range(SCREAMING_SNAKE_CASE_  ):
						for j in range(i + 1						,  SCREAMING_SNAKE_CASE_  ):
									if numbers[j] < numbers[i]:
												lowercase__  ,       lowercase__					  =				numbers[j], numbers[i]
			return numbers


if __name__ == "__main__":
							lowercase_								=     input("""Enter numbers separated by a comma:\n""").strip()
							lowercase_								=     [int(item) for item in user_input.split(""",""")]
							print(exchange_sort(unsorted))




