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:T728,

You are given an integer $$$n$$$. You need to construct an array of integers $$$a_1, a_2, \ldots, a_n$$$ such that the following conditions are satisfied:

$$$1 \leq a_i \leq 2 \cdot n$$$ for all $$$i$$$ from $$$1$$$ to $$$n$$$.
All elements of the array and the sums of adjacent elements are pairwise distinct. In other words, among the numbers $$$\{a_1, a_2, \ldots, a_n, a_1 + a_2, a_2 + a_3, \ldots, a_{n - 1} + a_n\}$$$, there should not be two equal numbers.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.

The only line of each test case contains one integer $$$n$$$ ($$$1 \le n \le 500$$$).

Output

For each test case, output an array of length $$$n$$$ that satisfies the condition of the problem. It can be shown that such an array always exists under the giv

Construct an Array

Examples