Hidden Colored Graph

**This is an interactive problem.** There is a hidden undirected graph with $n$ vertices. There are no self-loops or multiple edges. Each vertex is colored black or white, and the colors are also hidden from you. To make a query, you choose a vertex $v$. The interactor will respond with the current color of $v$, and then it will flip the colors of all vertices adjacent to $v$. A vertex is not co