

"""simple docstring"""

def 			SCREAMING_SNAKE_CASE       (   lowercase__      ) ->	list:
 for i, _ in enumerate(lowercase__      ):
  if (i % 2 == 1) == (nums[i - 1] > nums[i]):
   lowerCAmelCase__      :							Dict    =							nums[i], nums[i - 1]

 return nums


if __name__ == "__main__":
    print("""Enter the array elements:""")
    _UpperCamelCase		    =						list(map(int, input().split()))
    print("""The unsorted array is:""")
    print(array)
    print("""Array after Wiggle sort:""")
    print(wiggle_sort(array))









"""simple docstring"""

# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
from queue import Queue



def 			SCREAMING_SNAKE_CASE       (   lowercase__      ) ->	List[str]:
 lowerCAmelCase__      :							Tuple    =							Queue()
 lowerCAmelCase__      :							Optional[int]    =							[False] * len(lowercase__      )
 lowerCAmelCase__      :							Dict    =							[-1] * len(lowercase__      )

 def bfs():
  while not queue.empty():
   lowerCAmelCase__      :							Optional[Any]    =							queue.get()
   lowerCAmelCase__      :							Union[str, Any]    =							True

   for neighbour in graph[u]:
    if neighbour == u:
     return False

    if color[neighbour] == -1:
     lowerCAmelCase__      :							Any    =							1 - color[u]
     queue.put(lowercase__      )

    elif color[neighbour] == color[u]:
     return False

  return True

 for i in range(len(lowercase__      )      ):
  if not visited[i]:
   queue.put(lowercase__      )
   lowerCAmelCase__      :							int    =							0
   if bfs() is False:
    return False

 return True


if __name__ == "__main__":
    # Adjacency List of graph
    print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))






