Cringe Queries

You are given an array $A$ of $N$ integers, initially all zero. There are $Q$ types of operations that you are allowed to perform. Each operation is described by two integers $l_i$ and $r_i$ $(1 \leq l_i \leq r_i \leq N)$ and is as follows: - Set $A_j = A_j \oplus 1$ for each $j$ such that $l_i \leq j \leq r_i$. Here $\oplus$ represents the [Bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_op