C1. Permutaion Construction(easy version)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

This is the easy version of the problem.The only difference is that there is no the third restriction.

You're given an integer $$$n$$$.Construct a permutation $$$p$$$ of length $$$2n$$$ which satisfies:

  1. $$$p_1+p_2=p_3+p_4=...=p_{2n-1}+p_{2n}$$$
  2. $$$p_2+p_3=p_4+p_5=...=p_{2n-2}+p_{2n-1}$$$

If no solution,output $$$-1$$$ instead.

Input

The first line of input will contain a single integer $$$t(1 \leq t \leq 10^5)$$$, denoting the number of test cases.

Each test case consists a single line of input.

The only line of each test case contains an integer $$$n(2 \leq n \leq 10^5)$$$. The sum of $$$n$$$ over all test cases won't exceed $$$10^5$$$.

Output

For each test case, output on a new line — a permutaion of length $$$2n$$$ which satisfies the restrictions above.If no solution,output $$$-1$$$ instead.

Example
Input
2
2
3
Output
1 4 3 2
4 3 5 2 6 1