Xor Minimization (Easy)

**This is the easy version of the problem. In this version, you may find any permutation that satisfies the conditions. This problem is worth $100$ points in divisions $3$ and $4$, and $60$ points in divisions $1$ and $2$.** You are given an integer $N$ ($N\geq 3$). Find a permutation$^\dagger$ $P$ of the integers $1$ to $N$ such that $P_i \neq i$ for every index $i$, and $$ \max_{i=1}^N \lef