Permutation Xority

You are given an integer $N$. Construct a permutation $A$ of length $N$ which is **attractive**. A permutation is called **attractive** if the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all absolute differences of adjacent pairs of elements is equal to $0$. Formally, a permutation $A = [A_1, A_2, \ldots, A_N]$ of length $N$ is said to be attractive if: $$|A_{1}-A_{2}|