



def 						UpperCamelCase      (  snake_case__			:       Dict      )      ->	str:
   UpperCamelCase       :    Optional[int]		      =      [], []
   while len(__SCREAMING_SNAKE_CASE      ) > 1:
      UpperCamelCase       :    Tuple		      =      min(__SCREAMING_SNAKE_CASE      ), max(__SCREAMING_SNAKE_CASE      )
      start.append(__SCREAMING_SNAKE_CASE      )
      end.append(__SCREAMING_SNAKE_CASE      )
      collection.remove(__SCREAMING_SNAKE_CASE      )
      collection.remove(__SCREAMING_SNAKE_CASE      )
   end.reverse()
   return start + collection + end


if __name__ == "__main__":
    __UpperCAmelCase			  =			input('''Enter numbers separated by a comma:\n''').strip()
    __UpperCAmelCase			  =			[int(item) for item in user_input.split(''',''')]
    print(*merge_sort(unsorted), sep=''',''')









'''simple docstring'''






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   int:
      if n == 1 or not isinstance(__SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE		):
            return 0
      elif n == 2:
            return 1
      else:
            snake_case__       :   int	      =    [0, 1]
            for i in range(2				,      n + 1		):
                  sequence.append(sequence[i - 1] + sequence[i - 2]		)

            return sequence[n]






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   int:
      snake_case__       :   Optional[int]	      =    0
      snake_case__       :   Dict	      =    2

      while digits < n:
            index += 1
            snake_case__       :   Optional[int]	      =    len(str(fibonacci(__SCREAMING_SNAKE_CASE		)		)		)

      return index






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE = 1000		)    ->   int:
      return fibonacci_digits_index(__SCREAMING_SNAKE_CASE		)


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