OR Permutation

Given an integer $N$, find a permutation of size $N$ such that: - $A_i \neq A_{i-1}$ $|$ $A_{i-2}$ for all $3\le i \le N$, where $|$ denotes the [bitwise or operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). It is guaranteed that such permutation always exists. If multiple such permutations exist, you may print any. Note that a permutation of size $N$ consists of all integers from