





'''simple docstring'''


from __future__ import annotations
def 							UpperCAmelCase_  (						__lowerCamelCase : list[int]			):
   if len(__lowerCamelCase			) == 0:
      return array

   lowercase_      ,							lowercase_      :int         =			min(__lowerCamelCase			), max(__lowerCamelCase			)

   # Compute the variables
   lowercase_      :List[str]         =			_max - _min + 1
   lowercase_      ,							lowercase_      :Dict         =			[0] * holes_range, [0] * holes_range

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

   # Makes the array back by replacing the numbers.
   lowercase_      :str         =			0
   for i in range(__lowerCamelCase			):
      while holes_repeat[i] > 0:
         lowercase_      :Union[str, Any]         =			holes[i]
         index += 1
         holes_repeat[i] -= 1

    # Returns the sorted array.
   return array


if __name__ == "__main__":
 import doctest

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









'''simple docstring'''


def 							UpperCAmelCase_  (						__lowerCamelCase : list			):
   if len(__lowerCamelCase			) <= 1:
      return lst

   lowercase_      :Optional[Any]         =			1

   while i < len(__lowerCamelCase			):
      if lst[i - 1] <= lst[i]:
         i += 1
      else:
         lowercase_      ,							lowercase_      :int         =			lst[i], lst[i - 1]
         i -= 1
         if i == 0:
            lowercase_      :Dict         =			1

   return lst


if __name__ == "__main__":
 lowerCAmelCase :					Any 							=input('''Enter numbers separated by a comma:\n''').strip()
 lowerCAmelCase :					List[str] 							=[int(item) for item in user_input.split(''',''')]
 print(gnome_sort(unsorted))


