





'''simple docstring'''






from __future__ import annotations





def       lowercase_      (		lowercase__						)   ->list[int]:
						if len(lowercase__						) == 0:
												return array

						_snake_case					,						_snake_case:   List[Any]  					=		min(lowercase__						), max(lowercase__						)

						# Compute the variables
						_snake_case:   int  					=		_max - _min + 1
						_snake_case					,						_snake_case:   Tuple  					=		[0] * holes_range, [0] * holes_range

						# Make the sorting.
						for i in array:
												_snake_case:   List[str]  					=		i - _min
												_snake_case:   Any  					=		i
												holes_repeat[index] += 1

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

    # Returns the sorted array.
						return array


if __name__ == "__main__":
		import doctest

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












'''simple docstring'''






from __future__ import annotations

import sys
from collections import deque
from typing import Generic, TypeVar

A   : str             =			TypeVar('T')







class 			lowerCamelCase					(						Generic[T]  ):
					_SCREAMING_SNAKE_CASE							   =    42  # Cache store of keys
					_SCREAMING_SNAKE_CASE							   =    42  # References of the keys in cache
					_SCREAMING_SNAKE_CASE							   =    10  # Maximum capacity of cache


					def __init__(					self	:  List[Any]       ,     __snake_case	:  int       ):





											'''simple docstring'''





											_snake_case:   Dict  					=		deque()
											_snake_case:   Union[str, Any]  					=		set()
											if not n:
																	_snake_case:   Optional[int]  					=		sys.maxsize
											elif n < 0:
																	raise ValueError('n should be an integer greater than 0.'       )
											else:
																	_snake_case:   Tuple  					=		n


					def    SCREAMING_SNAKE_CASE_		(					self	:  Any       ,     __snake_case	:  T       ):





											'''simple docstring'''





											if x not in self.key_reference:
																	if len(self.dq_store       ) == LRUCache._MAX_CAPACITY:
																							_snake_case:   int  					=		self.dq_store.pop()
																							self.key_reference.remove(__snake_case       )
											else:
																	self.dq_store.remove(__snake_case       )

											self.dq_store.appendleft(__snake_case       )
											self.key_reference.add(__snake_case       )


					def    SCREAMING_SNAKE_CASE_		(					self	:  int       ):





											'''simple docstring'''





											for k in self.dq_store:
																	print(__snake_case       )




					def __repr__(					self	:  List[Any]       ):





											'''simple docstring'''





											return f'''LRUCache({self._MAX_CAPACITY}) => {list(self.dq_store       )}'''


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		A   : LRUCache[str | int]             =			LRUCache(4)
		lru_cache.refer('A')
		lru_cache.refer(2)
		lru_cache.refer(3)
		lru_cache.refer('A')
		lru_cache.refer(4)
		lru_cache.refer(5)
		lru_cache.display()

		print(lru_cache)
		assert str(lru_cache) == "LRUCache(4) => [5, 4, 'A', 3]"





