Permutation AND

Chef's last task in his internship requires him to construct $2$ permutations, each having length $N$, such that the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of each pair of elements at every index is the same. Formally, if the permutations are $A$ and $B$, then, the value $A_i \& B_i$ must be **constant** over all $1\le i \le N$. Help Chef by providing him $2$ such per