from __future__ import annotations






def _lowerCamelCase  (		snake_case  ):
							if len(snake_case  ) == 0:
														return array

							_lowerCAmelCase			,		_lowerCAmelCase							=							min(snake_case  ), max(snake_case  )

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

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

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

    # Returns the sorted array.
							return array


if __name__ == "__main__":
				import doctest

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







def _lowerCamelCase  (		snake_case = 10  ):
							if not isinstance(snake_case     , snake_case  ) or n < 0:
														raise ValueError('Invalid input'  )
							_lowerCAmelCase							=							10**n
							_lowerCAmelCase							=							28_433 * (pow(2     , 7_830_457     , snake_case  )) + 1
							return str(number % modulus  )


if __name__ == "__main__":
				from doctest import testmod

				testmod()
				print(f"""{solution(1_0) = }""")






