Problem: 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.

Input

The first line contains a single integer t (1 ≤ t ≤ 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 ≤ n ≤ 100) — the number of cats.

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

Output

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.

Example

Input


2
2
3


Output


2 1 
3 1 2 

Note

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].

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;

public class Sample {
    public static void main(String[] args) {
        ReadInput in = new ReadInput();
        int n = in.nextInt();
        while(n-->0) {
            int x = in.nextInt();
            if(x==2) {
                System.out.println("2 1");
                continue;
            }
            else if(x%2==0) {
                for(int i=1; i<=x; i+=2) {
                    System.out.print((i+1)+" ");
                    System.out.print((i)+" ");
                }
                System.out.println();
                continue;
            }
            for(int i=1; i<x-2; i+=2) {
                System.out.print((i+1)+" ");
                System.out.print((i)+" ");
            }
            System.out.println((x)+" "+(x-2)+" "+(x-1)+" ");
        }

    }

	static class ReadInput {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}

class TreeNode {
    int key, height;
    TreeNode left, right;
    TreeNode(int x) {
        this.key = x; this.height = 1;
        this.left=null; this.right=null;
    }
}

class BST {
    TreeNode root;
    TreeNode insert(TreeNode root, int key) {
        if (root == null) {
            root = new TreeNode(key);
            return root;
        }
        if (key < root.key) root.left = insert(root.left, key);
        else if (key > root.key) root.right = insert(root.right, key);
        return root;
    }
    TreeNode search(TreeNode root, int key) {
        if (root==null || root.key==key) return root;
        if (root.key < key) return search(root.right, key);
        return search(root.left, key);
    }
}


class AVL {
    TreeNode root;
    int height(TreeNode node) {
        if (node == null) return 0;
        return node.height;
    }
    TreeNode rightRotate(TreeNode y) {
        TreeNode x = y.left; TreeNode subtree = x.right;
        x.right = y; y.left = subtree;
        y.height = Math.max(height(y.left), height(y.right))+1;
        x.height = Math.max(height(x.left), height(x.right))+1;
        return x;
    }
    TreeNode leftRotate(TreeNode x) {
        TreeNode y = x.right; TreeNode subtree = y.left;
        y.left = x; x.right = subtree;
        x.height = Math.max(height(x.left), height(x.right))+1;
        y.height = Math.max(height(y.left), height(y.right))+1;
        return y;
    }
    int balanceCount(TreeNode node) {
        if (node == null) return 0;
        return height(node.left) - height(node.right);
    }
    TreeNode insert(TreeNode node, int key) {
        if (node == null) return (new TreeNode(key));
        if (key < node.key) node.left = insert(node.left, key);
        else if (key > node.key) node.right = insert(node.right, key);
        else return node;
        node.height = 1+Math.max(height(node.left), height(node.right));
        int count = balanceCount(node);
        if (count > 1) {
            if (key < node.left.key) return rightRotate(node);
            node.left = leftRotate(node.left); return rightRotate(node);
        }
        if (count < -1) {
            if(key > node.right.key) return leftRotate(node);
            node.right = rightRotate(node.right); return leftRotate(node);
        }
        return node;
    }
}

class ListNode {
    int key;
    ListNode next;
    ListNode(int x) { this.key = x; this.next = null; }
}

class Traversals {
    static void postorder(TreeNode node) {
        if (node == null) return; postorder(node.left);
        postorder(node.right); System.out.print(node.key+" ");
    }
    static void inorder(TreeNode node) {
        if (node == null) return; inorder(node.left);
        System.out.print(node.key+" "); inorder(node.right);
    }
    static void preorder(TreeNode node) {
        if (node == null) return; System.out.print(node.key+" ");
        preorder(node.left); preorder(node.right);
    }
}

class NT {
    static int gcd(int x, int y) {
        if (x == 0) return y; if (y == 0) return x;
        if (x == y) return x; if (x > y) return gcd(x-y, y);
        return gcd(x, y-x);
    }
    static boolean[] sievePrime(int n) {
        boolean isPrime[]=new boolean[n+1]; for(int i=0;i<=n;i++) isPrime[i]=true;
        for(int i=2;i*i<=n;i++) if(isPrime[i]==true) for(int j=i*i;j<=n;j+=i) isPrime[j]=false;
        return isPrime;
    }
}

class Sort {
    static void mergeSortHelper(int are[], int l, int m, int r)
    {
        int n1 = m - l + 1, n2 = r - m;
        int[] left = new int[n1];
        int[] right = new int[n2];
        for (int i = 0; i < n1; ++i) left[i] = are[l + i];
        for (int j = 0; j < n2; ++j) right[j] = are[m + 1 + j];
        int i = 0, j = 0, k = l;
        while (i < n1 && j < n2) {
            if (left[i] <= right[j]) {
                are[k] = left[i]; i++;
            }
            else {
                are[k] = right[j]; j++;
            }
            k++;
        }
        while (i < n1) {
            are[k] = left[i]; i++; k++;
        }
        while (j < n2) {
            are[k] = right[j]; j++; k++;
        }
    }
    static void mergeSort(int are[], int l, int r)
    {
        if (l<r) {
            int m=l+(r-l)/2;
            mergeSort(are, l, m); mergeSort(are, m + 1, r);
            mergeSortHelper(are, l, m, r);
        }
    }
}