Lexicographically Maximal Prefix AND

You are given an array $A$ of size $N$. You can rearrange the elements of $A$ as you want. After that, construct an array $B$ of size $N$ as: - $B_1 = A_1$; - $B_i = B_{i - 1}$ $\&$ $A_i$ for all $2 \le i \le N$, where $\&$ denotes the [bitwise AND operator](https://en.wikipedia.org/wiki/Bitwise_operation#AND). Find the **lexicographically largest** possible array $B$. For two arrays $X$ and $