
"""simple docstring"""







def    __lowerCAmelCase    ():
	for n in range(1	,  100_0000		):
		yield n * (n + 1) // 2
def    __lowerCAmelCase    (_UpperCamelCase		):
	__lowerCAmelCase      :						List[str]						      =				1
	__lowerCAmelCase      :						Union[str, Any]						      =				2
	while i * i <= n:
		__lowerCAmelCase      :						int						      =				0
		while n % i == 0:
			n //= i
			multiplicity += 1
		divisors_count *= multiplicity + 1
		i += 1
	if n > 1:
		divisors_count *= 2
	return divisors_count
def    __lowerCAmelCase    ():
	return next(i for i in triangle_number_generator() if count_divisors(_UpperCamelCase		) > 500		)


if __name__ == "__main__":
							print(solution())

"""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))