GCD and XOR

You are given an array $A$ of size $N$. You can perform the following operation as many times as you want (possibly, zero): - Choose integers $L, R, X$ such that $1 \le L \le R \le N$ and $1 \le X < 2^{30}$, and do any **one** of the following: - For all $L \le i \le R$, set $A_i$ to $A_i \oplus X$. $\oplus$ denotes the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) op