XOR Product

Chef has an array $A$ of length $N$. He can modify this array by applying a special operation **any** number of times. In one operation, he can: - Select two indices $i$ and $j$ $(1\le i \lt j \le |A|)$. - Append $A_i \oplus A_j$ to the end of the array, where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) - Remove $A_i$ and $A_j$ from the array