
"""simple docstring"""







def    __lowerCAmelCase    (_UpperCamelCase	,  _UpperCamelCase	,  _UpperCamelCase		):

 if n == 0:
  return 1

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

 else:
  __lowerCAmelCase      :						Optional[int]						      =				binary_exponentiation(__a	,  n / 2	,  __a		)
  return (b * b) % mod


# a prime number
lowerCamelCase__        =		701

lowerCamelCase__        =		1_000_000_000
lowerCamelCase__        =		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)

"""simple docstring"""







def    __lowerCAmelCase    (_UpperCamelCase		):
	if len(_UpperCamelCase		) <= 1:
		return lst

	__lowerCAmelCase      :						str						      =				1

	while i < len(_UpperCamelCase		):
		if lst[i - 1] <= lst[i]:
			i += 1
		else:
			__lowerCAmelCase      ,       __lowerCAmelCase      :						List[Any]						      =				lst[i], lst[i - 1]
			i -= 1
			if i == 0:
				__lowerCAmelCase      :						int						      =				1

	return lst


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