


from __future__ import annotations






def   _lowercase(					__a				:						list[list[int]]     ):

							# preprocessing the first row
							for i in range(1    ,     len(matrix[0]     )     ):
														matrix[0][i] += matrix[0][i - 1]

							# preprocessing the first column
							for i in range(1    ,     len(__a     )     ):
														matrix[i][0] += matrix[i - 1][0]

							# updating the path cost for current position
							for i in range(1    ,     len(__a     )     ):
														for j in range(1    ,     len(matrix[0]     )     ):
																					matrix[i][j] += min(matrix[i - 1][j]    ,     matrix[i][j - 1]     )

							return matrix[-1][-1]


if __name__ == "__main__":
	import doctest

	doctest.testmod()





def   _lowercase(					__a				:						list[int]     ):
							a__      =len(__a     )
							for i in range(__a     ):
														for j in range(i + 1    ,     __a     ):
																					if numbers[j] < numbers[i]:
																												a__    ,     a__      =numbers[j], numbers[i]
							return numbers


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

