


from __future__ import annotations


def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







			if len(_UpperCamelCase  ) == 0:
						return array

			__lowercase					, __lowercase 					=   min(_UpperCamelCase  ), max(_UpperCamelCase  )

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

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

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

    # Returns the sorted array.
			return array


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	a : Union[str, Any]		=				input('''Enter numbers separated by comma:\n''')
	a : Dict		=				[int(x) for x in user_input.split(''',''')]
	print(pigeon_sort(unsorted))






from ..utils import DummyObject, requires_backends
class 	lowerCamelCase_       (				metaclass=lowerCAmelCase__				):



					'''simple docstring'''







					__UpperCAmelCase            =				["speech"]






					def __init__(				self ,       *snake_case_ ,       **snake_case_						)   ->			List[str]:







								'''simple docstring'''

								requires_backends(self ,       ['''speech''']						)




class 	lowerCamelCase_       (				metaclass=lowerCAmelCase__				):



					'''simple docstring'''







					__UpperCAmelCase            =				["speech"]






					def __init__(				self ,       *snake_case_ ,       **snake_case_						)   ->			Tuple:







								'''simple docstring'''

								requires_backends(self ,       ['''speech''']						)


