Construct Permutation

You are given an integer $N$. Construct a permutation $P = [P_1, P_2, ..., P_N]$ such that there does not exist $i$ and $j$ ($1 \le i \le j \le N$) such that $(P_i + P_{i + 1} + ... + P_j) \mod (N + 1) = 0$. Informally, all subarray sums should not be divisible by $(N + 1)$. If it is not possible, print $-1$ instead. ### Input - The first line of input will contain a single integer $T$, denoti