CF1541A.Pretty Permutations

There are $n$ cats in a line, labeled from $1$ to $n$, with the $i$-th cat at position $i$. They are bored of gyrating in the same spot all day, so they want to reorder themselves such that no cat is in the same place as before. They are also lazy, so they want to minimize the total distance they move. Help them decide what cat should be at each location after the reordering.

For example, if there are $3$ cats, this is a valid reordering: $[3, 1, 2]$. No cat is in its original position. The total distance the cats move is $1 + 1 + 2 = 4$ as cat $1$ moves one place to the right, cat $2$ moves one place to the right, and cat $3$ moves two places to the left.

有 $n$ 只猫排成一列，编号为 $1$ 到 $n$，其中第 $i$ 只猫初始位于位置 $i$。它们整天原地打转，感到十分无聊，因此希望重新排列自己，使得没有一只猫停留在原来的位置上。同时，它们又很懒，希望最小化所有猫移动的总距离。请帮助它们确定重排后每个位置上应是哪只猫。

例如，当有 $3$ 只猫时，$[3, 1, 2]$ 是一种合法的重排：没有一只猫位于其原始位置。猫移动的总距离为 $1 + 1 + 2 = 4$，其中猫 $1$ 向右移动 $1$ 个位置，猫 $2$ 向右移动 $1$ 个位置，猫 $3$ 向左移动 $2$ 个位置。

The first line contains a single integer $t$ ($1 \leq t \leq 100$) — the number of test cases. Then $t$ test cases follow.

The first and only line of each test case contains one integer $n$ ($2 \leq n \leq 100$) — the number of cats.

It can be proven that under the constraints of the problem, an answer always exist.

第一行包含一个整数 $t$（$1 \leq t \leq 100$）—— 测试用例的数量。随后是 $t$ 个测试用例。

每个测试用例仅有一行，包含一个整数 $n$（$2 \leq n \leq 100$）—— 猫的数量。

在本题的约束条件下，可以证明答案一定存在。

Output $t$ answers, one for each test case. Each answer consists of $n$ integers — a permutation with the minimum total distance. If there are multiple answers, print any.

输出 $t$ 个答案，每个测试用例对应一个答案。每个答案包含 $n$ 个整数——即一个总距离最小的排列。如果存在多个答案，输出任意一个即可。

For the first test case, there is only one possible permutation that satisfies the conditions: $[2, 1]$.

The second test case was described in the statement. Another possible answer is $[2, 3, 1]$.

对于第一个测试用例，唯一满足条件的排列是：$[2, 1]$。

第二个测试用例已在题目描述中给出。另一个可能的答案是 $[2, 3, 1]$。