



"""simple docstring"""


from itertools import compress, repeat
from math import ceil, sqrt

def 					_lowerCAmelCase (  lowercase_		):

						if num <= 2:
												return []
						if num == 3:
												return [2]

						# Odd sieve for numbers in range [3, num - 1]
						UpperCAmelCase			 =					bytearray(B'\x01'		) * ((num >> 1) - 1)

						for i in range(3						,      int(sqrt(lowercase_		)		) + 1						,      2		):
												if sieve[(i >> 1) - 1]:
																		UpperCAmelCase			 =					i**2
																		UpperCAmelCase			 =					repeat(
																		    0						,      ceil((num - i_squared) / (i << 1)		)		)

						return [2] + list(compress(range(3						,      lowercase_						,      2		)						,      lowercase_		)		)


if __name__ == "__main__":
				import doctest

				doctest.testmod()













def  UpperCAmelCase__						(    lowerCamelCase	:			list    ):
   lowerCamelCase									=1.3
   lowerCamelCase									=len(lowerCamelCase    )
   lowerCamelCase									=False

   while not completed:
      # Update the gap value for a next comb
      lowerCamelCase									=int(gap / shrink_factor    )
      if gap <= 1:
         lowerCamelCase									=True

      lowerCamelCase									=0
      while index + gap < len(lowerCamelCase    ):
         if data[index] > data[index + gap]:
            # Swap values
            lowerCamelCase				,       lowerCamelCase									=data[index + gap], data[index]
            lowerCamelCase									=False
         index += 1

   return data


if __name__ == "__main__":
   import doctest

   doctest.testmod()

   _UpperCAmelCase					:						List[Any]         =     input('Enter numbers separated by a comma:\n').strip()
   _UpperCAmelCase					:						Optional[Any]         =     [int(item) for item in user_input.split(',')]
   print(comb_sort(unsorted))