Distinct Fun

You are given an array $A$ of length $N$. In one operation, you may choose a prefix of the array of length $k$ ($1 ≤ k ≤ N$) and an integer $X ≥ 0$, and apply the $bitwise XOR$ operation to all elements in that prefix: - $[ A_i = A_i \oplus X \text{ for all } 1 \le i \le k]$ (Here, $⊕$ denotes [bitwise XOR](https://en.wikipedia.org/wiki/Exclusive_or).) Your goal is to make **all elements of t