
def 				UpperCAmelCase_						(				__SCREAMING_SNAKE_CASE				):
	lowercase	    =       set()
	# To detect a back edge, keep track of vertices currently in the recursion stack
	lowercase	    =       set()
	return any(
	    node not in visited and depth_first_search(__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE				)
	    for node in graph				)






def 				UpperCAmelCase_						(				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE				):
	visited.add(__SCREAMING_SNAKE_CASE				)
	rec_stk.add(__SCREAMING_SNAKE_CASE				)

	for node in graph[vertex]:
		if node not in visited:
			if depth_first_search(__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE					,				__SCREAMING_SNAKE_CASE				):
				return True
		elif node in rec_stk:
			return True

    # The node needs to be removed from recursion stack before function ends
	rec_stk.remove(__SCREAMING_SNAKE_CASE				)
	return False


if __name__ == "__main__":
	from doctest import testmod

	testmod()





def  a   (lowerCAmelCase__   ):
   __a					=  False
   while is_sorted is False:  # Until all the indices are traversed keep looping
      __a					=  True
      for i in range(0		,				len(lowerCAmelCase__   ) - 1		,				2   ):  # iterating over all even indices
         if input_list[i] > input_list[i + 1]:
            __a	,    __a					=  input_list[i + 1], input_list[i]
            # swapping if elements not in order
            __a					=  False

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


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



