

"""simple docstring"""





# Author: OMKAR PATHAK, Nwachukwu Chidiebere

# Use a Python dictionary to construct the graph.
from __future__ import annotations

from pprint import pformat
from typing import Generic, TypeVar

_a       =							TypeVar('T')




class 					_lowerCAmelCase  (	Generic[T]   ):







 """simple docstring"""







 def __init__(			self							:			Any,					UpperCAmelCase__							:			bool = True	):
    __lowercase								=						{}  # dictionary of lists
    __lowercase								=						directed


 def 					_lowercase (			self							:			Dict,					UpperCAmelCase__							:			T,					UpperCAmelCase__							:			T	):

    if not self.directed:  # For undirected graphs
       # if both source vertex and destination vertex are both present in the
       # adjacency list, add destination vertex to source vertex list of adjacent
       # vertices and add source vertex to destination vertex list of adjacent
       # vertices.
       if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(UpperCAmelCase__	)
          self.adj_list[destination_vertex].append(UpperCAmelCase__	)
       # if only source vertex is present in adjacency list, add destination vertex
       # to source vertex list of adjacent vertices, then create a new vertex with
       # destination vertex as key and assign a list containing the source vertex
       # as it's first adjacent vertex.
       elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(UpperCAmelCase__	)
          __lowercase								=						[source_vertex]
       # if only destination vertex is present in adjacency list, add source vertex
       # to destination vertex list of adjacent vertices, then create a new vertex
       # with source vertex as key and assign a list containing the source vertex
       # as it's first adjacent vertex.
       elif destination_vertex in self.adj_list:
          self.adj_list[destination_vertex].append(UpperCAmelCase__	)
          __lowercase								=						[destination_vertex]
       # if both source vertex and destination vertex are not present in adjacency
       # list, create a new vertex with source vertex as key and assign a list
       # containing the destination vertex as it's first adjacent vertex also
       # create a new vertex with destination vertex as key and assign a list
       # containing the source vertex as it's first adjacent vertex.
       else:
          __lowercase								=						[destination_vertex]
          __lowercase								=						[source_vertex]
    else:  # For directed graphs
       # if both source vertex and destination vertex are present in adjacency
       # list, add destination vertex to source vertex list of adjacent vertices.
       if source_vertex in self.adj_list and destination_vertex in self.adj_list:
          self.adj_list[source_vertex].append(UpperCAmelCase__	)
       # if only source vertex is present in adjacency list, add destination
       # vertex to source vertex list of adjacent vertices and create a new vertex
       # with destination vertex as key, which has no adjacent vertex
       elif source_vertex in self.adj_list:
          self.adj_list[source_vertex].append(UpperCAmelCase__	)
          __lowercase								=						[]
       # if only destination vertex is present in adjacency list, create a new
       # vertex with source vertex as key and assign a list containing destination
       # vertex as first adjacent vertex
       elif destination_vertex in self.adj_list:
          __lowercase								=						[destination_vertex]
       # if both source vertex and destination vertex are not present in adjacency
       # list, create a new vertex with source vertex as key and a list containing
       # destination vertex as it's first adjacent vertex. Then create a new vertex
       # with destination vertex as key, which has no adjacent vertex
       else:
          __lowercase								=						[destination_vertex]
          __lowercase								=						[]

    return self



 def __repr__(			self							:			Any	):
    return pformat(self.adj_list	)







"""simple docstring"""





def   _A  (  UpperCamelCase_     :       Any)	->						List[str]:
   '''simple docstring'''


   __lowercase		,__lowercase								=						[], []
   while len(UpperCamelCase_) > 1:
      __lowercase		,__lowercase								=						min(UpperCamelCase_), max(UpperCamelCase_)
      start.append(UpperCamelCase_)
      end.append(UpperCamelCase_)
      collection.remove(UpperCamelCase_)
      collection.remove(UpperCamelCase_)
   end.reverse()
   return start + collection + end


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




