Yet Another XOR Sort 2

You have an array $A$ with $N$ elements. You can perform the following operation at most $20 \times N$ times: - Select two indices $i, j$ satisfying $A_i \neq A_j$, and set both $A_i$ and $A_j$ to $A_i \oplus A_j$. Here, $\oplus$ denotes the bitwise XOR operation. Your goal is to make the final array sorted in non-decreasing order. Find a sequence of operations that achieves this. It can