Solve the programming task below in a Python markdown code block.
You are given an integer N. 

Construct any permutation A of N integers such that the value LCM(1 + A_{1} , 2 + A_{2}, \ldots, N + A_{N}) is minimised. 

Note:
LCM denotes the [least common multiple] of the integers.
A permutation of N integers contains all integers from 1 to N exactly once.

------ Input Format ------ 

- First line will contain T, number of test cases. Then the test cases follow.
- Each test case contains a single line of input, one integer N.

------ Output Format ------ 

For each test case, output a permutation that minimises the value LCM(1 + A_{1} , 2 + A_{2}, \ldots, N + A_{N}).

------ Constraints ------ 

$1 ≤ T ≤ 1000$
$2 ≤ N ≤ 1000$

----- Sample Input 1 ------ 
1
2

----- Sample Output 1 ------ 
2 1 

----- explanation 1 ------ 
Test case $1$: The permutation for which the value is minimised is $[2, 1]$. The minimum value is $LCM(1+2, 2+1) = LCM(3, 3) = 3$.