






import math







def   SCREAMING_SNAKE_CASE       (				snake_case_      :							str  ,						snake_case_      :							str     ):
	if 0 not in (x, y):
		# We use the relation x^y = y*log10(x), where 10 is the base.
		return y * math.logaa(snake_case_     )
	else:
		if x == 0:  # 0 raised to any number is 0
			return 0
		elif y == 0:
			return 1  # any number raised to 0 is 1
	raise AssertionError("This should never happen"     )


if __name__ == "__main__":  # Main function
				# Read two numbers from input and typecast them to int using map function.
				# Here x is the base and y is the power.
				__lowerCamelCase      :    Tuple   		=   """Enter the base and the power separated by a comma: """
				__lowerCamelCase      :    List[Any]   		=   map(int, input(prompt).split(""","""))
				__lowerCamelCase      :    Any   		=   map(int, input(prompt).split(""","""))

				# We find the log of each number, using the function res(), which takes two
				# arguments.
				__lowerCamelCase      :    Union[str, Any]   		=   res(xa, ya)
				__lowerCamelCase      :    Optional[int]   		=   res(xa, ya)

				# We check for the largest number
				if resa > resa:
								print("""Largest number is""", xa, """^""", ya)
				elif resa > resa:
								print("""Largest number is""", xa, """^""", ya)
				else:
								print("""Both are equal""")











def   SCREAMING_SNAKE_CASE       (				snake_case_      :							list     ):
	if len(snake_case_     ) <= 1:
		return lst

	snake_case__				:   List[Any]     =						1

	while i < len(snake_case_     ):
		if lst[i - 1] <= lst[i]:
			i += 1
		else:
			snake_case__,		snake_case__				:   Tuple     =						lst[i], lst[i - 1]
			i -= 1
			if i == 0:
				snake_case__				:   Union[str, Any]     =						1

	return lst


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



