13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T674,

Yes, this is another one of those constructive permutation problems.

You are given an integer $$$n$$$. You have to construct a permutation $$$p$$$ of size $$$n$$$, i. e. an array of $$$n$$$ integers, where every integer from $$$1$$$ to $$$n$$$ appears exactly once.

Every pair of adjacent elements in the permutation ($$$p_i$$$ and $$$p_{i+1}$$$) must meet the following condition:

if one of them is divisible by the other, the condition $$$p_i \lt p_{i+1}$$$ must hold;
otherwise, the condition $$$p_i \gt p_{i+1}$$$ must hold.

Input

The first line contains one integer $$$t$$$ ($$$1 \le t \le 99$$$) — the number of test cases.

Each test case consists of one line, containing one integer $$$n$$$ ($$$2 \le n \le 100$$$).

Output

For each test case, print the answer as follows:

if no pe

Shuffle

Examples