


from __future__ import annotations
def 				UpperCAmelCase_					(							__snake_case						)     ->			list[int]:







 """simple docstring"""


 if len(__snake_case						) == 0:
  return array

 _lowercase      ,    _lowercase							      =min(__snake_case						), max(__snake_case						)

 # 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(__snake_case						):
  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()
  UpperCAmelCase__   	=							input('''Enter numbers separated by comma:\n''')
  UpperCAmelCase__   	=							[int(x) for x in user_input.split(''',''')]
  print(pigeon_sort(unsorted))



def       A       (					lowercase )   ->  str:
		'''simple docstring'''

		return " ".join(
		    ''.join(word[::-1] ) if len(lowercase ) > 4 else word for word in sentence.split() )


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					print(reverse_long_words("Hey wollef sroirraw"))
