import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author PRANJAL AGNIHOTRI
*/
public class Main {
public static void main
(String[] args
) { InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
MINPERM solver = new MINPERM();
solver.solve(1, in, out);
out.close();
}
static class MINPERM {
public void solve(int testNumber, InputReader in, OutputWriter out) {
int T = in.nextInt();
while (T-- > 0) {
int N = in.nextInt();
long[] array = new long[N];
if (N % 2 == 0) {
for (int i = 1; i <= N; i += 2) {
int a = i;
int b = i + 1;
array[i - 1] = b;
array[i] = a;
}
} else {
int pos = N / 2 + 1;
for (int i = 1; i <= N; i += 2) {
if (i == pos || i == pos - 1) {
if (i == pos - 1) {
pos = pos - 1;
}
while (i != N) {
array[i - 1] = i + 1;
i = i + 1;
}
array[N - 1] = pos;
} else {
if (i == N) {
array[N - 1] = i - 1;
break;
}
int a = i;
int b = i + 1;
array[i - 1] = b;
array[i] = a;
}
}
}
out.println(array);
}
}
}
static class OutputWriter {
}
public OutputWriter
(Writer writer
) { }
public void print(long[] array) {
for (int i = 0; i < array.length; i++) {
if (i != 0) {
writer.print(' ');
}
writer.print(array[i]);
}
}
public void println(long[] array) {
print(array);
writer.println();
}
public void close() {
writer.close();
}
}
static class InputReader {
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private InputReader.SpaceCharFilter filter;
this.stream = stream;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
}