Prefix Permutation

You are given an integer $N$. Your task is to generate a permutation $P$ of size $N$, such that: - For all $(1\lt i\le N)$, $\sum_{j = 1}^{i} P_j$ is **not divisible** by $i$. In other words, the sum of prefix of length $i$ $(i\gt 1)$ should not be divisible by $i$. In case multiple such permutations exist, print any. If no such permutation exists, print $-1$ instead. Note that a permutation