The first line contains one integer TTT (1≤T≤1051\le T \le 10^51≤T≤105), denoting the number of test cases. For each test case, input only one line containing one integer nnn (2≤n≤1052\le n \le 10^52≤n≤105). It is guaranteed that the sum of nnn among all test cases in one test file does not exceed 10610^6106.
If solution exists, print one line containing nnn integers P1,P2,…,PnP_1, P_2, \ldots, P_nP1,P2,…,Pn (1≤Pi≤n1 \le P_i \le n1≤Pi≤n, ∀1≤i<j≤n,Pi≠Pj\forall \, 1 \le i < j \le n, P_i \neq P_j∀1≤i<j≤n,Pi=Pj), denoting the permutation you construct. If no solution, print "-1" in one line.
2
3
5
1 2 3
5 2 1 4 3