






def 	UpperCamelCase	(							snake_case__  : Optional[Any]	):




     '''simple docstring'''






     def merge(snake_case__  : Optional[int]						,snake_case__  : Optional[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(snake_case__	) <= 1:
          return collection
     __snake_case      :Tuple 							=    len(snake_case__	) // 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=""",""")









def  __magic_name__  (				lowercase = 1000				)				-> int:

							"""simple docstring"""



							lowercase_				,		lowercase_	:   Optional[Any]  				=     1, 1
							lowercase_	:   Tuple  				=     2
							while True:
														lowercase_	:   Dict  				=     0
														lowercase_	:   List[Any]  				=     fa + fa
														lowercase_				,		lowercase_	:   List[str]  				=     fa, f
														index += 1
														for _ in str(lowercase				):
																					i += 1
														if i == n:
																					break
							return index


if __name__ == "__main__":
							print(solution(int(str(input()).strip())))