



"""simple docstring"""
def      __magic_name__				(							lowercase ):  # noqa: E741
   SCREAMING_SNAKE_CASE_: Any     			=len(lowercase )
   SCREAMING_SNAKE_CASE_: List[Any]     			=0
   SCREAMING_SNAKE_CASE_: Optional[Any]     			=[0] * n
   SCREAMING_SNAKE_CASE_: Union[str, Any]     			=[False] * n
   SCREAMING_SNAKE_CASE_: Union[str, Any]     			=[False] * n

   def dfs(lowercase							,			lowercase							,			lowercase							,			lowercase ):
      if parent == root:
         out_edge_count += 1
      SCREAMING_SNAKE_CASE_: List[str]     			=True
      SCREAMING_SNAKE_CASE_: str     			=at

      for to in l[at]:
         if to == parent:
            pass
         elif not visited[to]:
            SCREAMING_SNAKE_CASE_: Optional[int]     			=dfs(lowercase							,			lowercase							,			lowercase							,			lowercase )
            SCREAMING_SNAKE_CASE_: List[str]     			=min(low[at]							,			low[to] )

            # AP found via bridge
            if at < low[to]:
               SCREAMING_SNAKE_CASE_: Any     			=True
            # AP found via cycle
            if at == low[to]:
               SCREAMING_SNAKE_CASE_: Dict     			=True
         else:
            SCREAMING_SNAKE_CASE_: Any     			=min(low[at]							,			lowercase )
      return out_edge_count

   for i in range(lowercase ):
      if not visited[i]:
         SCREAMING_SNAKE_CASE_: Optional[int]     			=0
         SCREAMING_SNAKE_CASE_: Tuple     			=dfs(lowercase							,			lowercase							,			-1							,			lowercase )
         SCREAMING_SNAKE_CASE_: Any     			=out_edge_count > 1

   for x in range(len(lowercase ) ):
      if is_art[x] is True:
         print(lowercase )


# Adjacency list of graph
_UpperCAmelCase     =			{
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}
compute_ap(data)








"""simple docstring"""
def      __magic_name__				(							lowercase ):
   SCREAMING_SNAKE_CASE_: int     			=False
   while is_sorted is False:  # Until all the indices are traversed keep looping
      SCREAMING_SNAKE_CASE_: Tuple     			=True
      for i in range(0							,			len(lowercase ) - 1							,			2 ):  # iterating over all even indices
         if input_list[i] > input_list[i + 1]:
            SCREAMING_SNAKE_CASE_			,		SCREAMING_SNAKE_CASE_: Optional[int]     			=input_list[i + 1], input_list[i]
            # swapping if elements not in order
            SCREAMING_SNAKE_CASE_: Tuple     			=False

      for i in range(1							,			len(lowercase ) - 1							,			2 ):  # iterating over all odd indices
         if input_list[i] > input_list[i + 1]:
            SCREAMING_SNAKE_CASE_			,		SCREAMING_SNAKE_CASE_: str     			=input_list[i + 1], input_list[i]
            # swapping if elements not in order
            SCREAMING_SNAKE_CASE_: str     			=False
   return input_list


if __name__ == "__main__":
   print("""Enter list to be sorted""")
   _UpperCAmelCase     =			[int(x) for x in input().split()]
   # inputing elements of the list in one line
   _UpperCAmelCase     =			odd_even_sort(input_list)
   print("""The sorted list is""")
   print(sorted_list)



