from __future__ import annotations
def 					_snake_case	(  __snake_case						):
					if len(__snake_case						) == 0:
										return array

					_UpperCamelCase     ,    _UpperCamelCase			     =     min(__snake_case						), max(__snake_case						)

					# Compute the variables
					_UpperCamelCase			     =     _max - _min + 1
					_UpperCamelCase     ,    _UpperCamelCase			     =     [0] * holes_range, [0] * holes_range

					# Make the sorting.
					for i in array:
										_UpperCamelCase			     =     i - _min
										_UpperCamelCase			     =     i
										holes_repeat[index] += 1

					# Makes the array back by replacing the numbers.
					_UpperCamelCase			     =     0
					for i in range(__snake_case						):
										while holes_repeat[i] > 0:
															_UpperCamelCase			     =     holes[i]
															index += 1
															holes_repeat[i] -= 1

    # Returns the sorted array.
					return array


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					_lowerCAmelCase       =		input("Enter numbers separated by comma:\n")
					_lowerCAmelCase       =		[int(x) for x in user_input.split(",")]
					print(pigeon_sort(unsorted))




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

