
def      UpperCamelCase   (       __lowerCamelCase	:					Union[str, Any]       ):

       def merge(__lowerCamelCase	:					int							,   __lowerCamelCase	:					List[Any]       ) -> list:

              def _merge():
                     while left and right:
                            yield (left if left[0] <= right[0] else right).pop(0       )
                     yield from left
                     yield from right

              return list(_merge()       )

       if len(__a       ) <= 1:
              return collection
       snake_case			:  str     							= len(__a       ) // 2
       return merge(merge_sort(collection[:mid]       )							,   merge_sort(collection[mid:]       )       )


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   __lowerCamelCase				=			input("""Enter numbers separated by a comma:\n""").strip()
   __lowerCamelCase				=			[int(item) for item in user_input.split(""",""")]
   print(*merge_sort(unsorted), sep=""",""")







"""simple docstring"""




from __future__ import annotations

import math



def 							_lowerCamelCase			(			__a     ):

		if num <= 0:
				SCREAMING_SNAKE_CASE_    			=			F'{num}: Invalid input, please enter a positive integer.'
				raise ValueError(__a     )

		SCREAMING_SNAKE_CASE_    			=			[True] * (num + 1)
		SCREAMING_SNAKE_CASE_    			=			[]
		SCREAMING_SNAKE_CASE_    			=			2
		SCREAMING_SNAKE_CASE_    			=			int(math.sqrt(__a     )     )

		while start <= end:
				# If start is a prime
				if sieve[start] is True:
						prime.append(__a     )

						# Set multiples of start be False
						for i in range(start * start,				num + 1,				__a     ):
								if sieve[i] is True:
										SCREAMING_SNAKE_CASE_    			=			False

				start += 1

		for j in range(end + 1,				num + 1     ):
				if sieve[j] is True:
						prime.append(__a     )

		return prime


if __name__ == "__main__":
						print(prime_sieve(int(input('Enter a positive integer: ').strip())))