Yet Another XOR Sort

You are given an array $A$ of size $N$. You can perform the following operation on the array: - Choose an index $i$ $(1 \le i \le N)$; - Choose a set of indices $S$ of size $K$, $(1 \le K \le N, 1\le S_j \le N)$; - Set $A_i = A_{S_1}\oplus A_{S_2}\oplus A_{S_3}\oplus \ldots \oplus A_{S_K}$, where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). Le