Bitwise swaps

Given an array $A$ consisting of $N$ integers $A_1,A_2,…,A_N$, determine if you can sort this array by applying the following operation several times (possibly, zero): - Pick a pair of indices $(i,j)$ with $i \neq j$ and $A_i \mathbin{\&} A_j \neq 0$, and swap the values of $A_i$ and $A_j$. Here, $\mathbin{\&}$ denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operat