from __future__ import annotations





def    __lowercase     (						lowerCamelCase					:     list[int]	):
 if len(lowerCamelCase	) == 0:
  return array

 UpperCamelCase_, UpperCamelCase_					:						Any =					min(lowerCamelCase	), max(lowerCamelCase	)

 # Compute the variables
 UpperCamelCase_					:						int =					_max - _min + 1
 UpperCamelCase_, UpperCamelCase_					:						Optional[Any] =					[0] * holes_range, [0] * holes_range

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

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

    # Returns the sorted array.
 return array


if __name__ == "__main__":
   import doctest

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




from __future__ import annotations





def    __lowercase     (						lowerCamelCase					:     Optional[Any]  ,  lowerCamelCase					:     Dict  ,  lowerCamelCase					:     Union[str, Any]  ,  lowerCamelCase					:     List[str]	):  # noqa: E741
 while r - l > 1:
  UpperCamelCase_					:						Union[str, Any] =					(l + r) // 2
  if v[m] >= key:
   UpperCamelCase_					:						str =					m
  else:
   UpperCamelCase_					:						List[Any] =					m  # noqa: E741
 return r





def    __lowercase     (						lowerCamelCase					:     list[int]	):
 if len(lowerCamelCase	) == 0:
  return 0

 UpperCamelCase_					:						Tuple =					[0] * len(lowerCamelCase	)
 UpperCamelCase_					:						int =					1

 UpperCamelCase_					:						Dict =					v[0]

 for i in range(1  ,  len(lowerCamelCase	)	):
  if v[i] < tail[0]:
   UpperCamelCase_					:						Any =					v[i]
  elif v[i] > tail[length - 1]:
   UpperCamelCase_					:						Dict =					v[i]
   length += 1
  else:
   UpperCamelCase_					:						List[str] =					v[i]

 return length


if __name__ == "__main__":
   import doctest

   doctest.testmod()



