Good Sequence

A sequence $A$ of length $2N$ contains $N$ zeros and $N$ ones. Apply the following operation $0$ or more times. If $A$ can be made to contain $N$, then $A$ is called a good sequence.

• Pick 4 consecutive integers from $A$ and call them $x$, $y$, $z$, $w$ in order. Let $L$ be the length of $A$ before the operation.
• Delete $x$, $y$, $z$, $w$ and insert $w$, $x+y$ in their place, in that order.
• In other words, $A_1, A_2, \cdots, x, y, z, w, \cdots, A_L$ becomes $A_1, A_2, \cdots, w, x+y, \cdots, A_L$.

A sequence $B$ of length $2N$ is given, with $N$ zeros and $N$ ones. After each query below, determine whether $B$ is a good sequence.

• $l\ r$: Flip $B_i$ for every $i$ with $l \le i \le r$. That is, change $1$ to $0$ and $0$ to $1$. The number of ones and the number of zeros in the range $[l, r]$ are guaranteed to be equal.

The first line contains the integer $N$.

The second line contains $2N$ integers $B_1, B_2, \cdots, B_{2N}$, separated by spaces.

The third line contains the integer $Q$.

Each of the next $Q$ lines contains two integers $l$ and $r$, separated by a space.

Print $Q+1$ lines. On line $i$, print YES if $B$ is a good sequence after applying the first $i-1$ queries in order, and NO otherwise.

• $2\le N\le 2\times 10^5$
• $B_i\in\{0,1\}$ $(1\le i\le 2N)$
• $\sum_{i=1}^{2N} B_i=N$
• $0\le Q\le 2\times 10^5$
• $1\le l\le r\le 2N$