



def 					__lowerCAmelCase		(  __lowerCamelCase	:    list				,   __lowerCamelCase	:    list				,   __lowerCamelCase	:    int	)  ->						list:
					__lowerCAmelCase	   =len(__lowerCamelCase	)
					__lowerCAmelCase	   =[[0] * n for i in range(__lowerCamelCase	)]
					for i in range(__lowerCamelCase	):
										__lowerCAmelCase	   =y_points[i]

					for i in range(2				,   __lowerCamelCase	):
										for j in range(__lowerCamelCase				,   __lowerCamelCase	):
															__lowerCAmelCase	   =(
															    (xa - x_points[j - i + 1]) * q[j][i - 1]
															    - (xa - x_points[j]) * q[j - 1][i - 1]
															) / (x_points[j] - x_points[j - i + 1])

					return [q[n - 1][n - 1], q]


if __name__ == "__main__":
				import doctest

				doctest.testmod()









def 					__lowerCAmelCase		(  __lowerCamelCase	:    list	)  ->						list:
					if len(__lowerCamelCase	) <= 1:
										return lst

					__lowerCAmelCase	   =1

					while i < len(__lowerCamelCase	):
										if lst[i - 1] <= lst[i]:
															i += 1
										else:
															__lowerCAmelCase   ,	__lowerCAmelCase	   =lst[i], lst[i - 1]
															i -= 1
															if i == 0:
																				__lowerCAmelCase	   =1

					return lst


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




