A permutation p1, p2, ... , pn of 1, 2, ..., n is called a lucky permutation if and only if pi ≡ 0 (mod|pi - pi - 2|) for i = 3 ... n.
Now you need to construct a lucky permutation with a given n.
输入描述:
The first line is the number of test cases.
For each test case, one single line contains a positive integer n(3 ≤ n ≤ 105).
输出描述:
For each test case, output a single line with n numbers p1, p2, ... , pn.
It is guaranteed that there exists at least one solution. And if there are different solutions, print any one of them.