Good Permutation

A permutation $P$ of length $N$ ($1$-based) is called good if it satisfies the following these conditions: - For each $1 \le i \le N$, $P_i \neq i$ - $|P_1 - 1| \oplus |P_2 - 2| \oplus \ldots \oplus |P_N - N| = 0$ Here, $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) and $|X|$ denotes the absolute value of $X$. Find any good permutation $P$ of le