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.lang.*;
import java.math.*;
import java.io.*;
import java.util.*;

 
public class Practice{
	
	
	 static class FastReader {
	        BufferedReader br;
	        StringTokenizer st;
	 
	        public FastReader()
	        {
	            br = new BufferedReader(
	                new InputStreamReader(System.in));
	        }
	 
	        String next()
	        {
	            while (st == null || !st.hasMoreElements()) {
	                try {
	                    st = new StringTokenizer(br.readLine());
	                }
	                catch (IOException e) {
	                    e.printStackTrace();
	                }
	            }
	            return st.nextToken();
	        }
	 
	        int nextInt() { return Integer.parseInt(next()); }
	 
	        long nextLong() { return Long.parseLong(next()); }
	 
	        double nextDouble()
	        {
	            return Double.parseDouble(next());
	        }
	 
	        String nextLine()
	        {
	            String str = "";
	            try {
	                str = br.readLine();
	            }
	            catch (IOException e) {
	                e.printStackTrace();
	            }
	            return str;
	        }
	    }
	 
	 
	 static int  gcd(int a, int b) {


	    if (b == 0) {
	        return a;}
	    else {
	        return gcd(b, a % b);}}
	 
	 //for prime no
	  static boolean isPrime(int n) {
	        return BigInteger.valueOf(n).isProbablePrime(1);
	    }
	 
	    static boolean isPrime(long n) {
	        return BigInteger.valueOf(n).isProbablePrime(1);
	    }

	 static boolean[] seiveOfEratoSthenes(int n) {
		 boolean isPrime[]=new boolean[n+1];
		 Arrays.fill(isPrime, true);
		 isPrime[0]=false;
		 isPrime[1]=false;
		 for(int i=2;i<=Math.sqrt(n);i++) {
			 for(int j=2*i;j<=n;j+=i) {
				 isPrime[j]=false;
			 }
		 }
		 
		 return isPrime;
		 
	 }
	 
	 static long modulo(long a,long b,int n) {
		 long res=1;
		 
		 while(b>0) {
			 if((b&1)==1) {
				 res=(res*(a%n))%n;
			 }
			 a=((a%n)*(a%n))%n;
			 b=b>>1;
			 
		 }
		 return res;
	 }
	 
	 static class Pair  implements Comparable<Pair>{
		 double a;
		 int b;
		 
		
	
		 
		 Pair(double tim,int index){  
			 this.b=index;
			  
			 this.a=tim;  
		
			 }  
		 public int compareTo(Pair st){  
			 if(a==st.a)  
			 return b-st.b;  
			 else if(a>st.a)  
			 return 1;  
			 else  
			 return -1;  
			 }  
	 } 
	 
	
	 static boolean isPalindrome(String s) {
	        int length = s.length();
	        for (int i = 0; i < length / 2; i++) {
	            if (s.charAt(i) != s.charAt(length - 1 - i)) {
	                return false;
	            }
	        }
	        return true;
	    }
	 
	 	static void reverseArray(int[] arr) {
	        for (int i = 0; i < arr.length / 2; i++) {
	            int temp = arr[i];
	            arr[i] = arr[arr.length - 1 - i];
	            arr[arr.length - 1 - i] = temp;
	        }
	    }
	 
	    static void reverseArray(String[] arr) {
	        for (int i = 0; i < arr.length / 2; i++) {
	            String temp = arr[i];
	            arr[i] = arr[arr.length - 1 - i];
	            arr[arr.length - 1 - i] = temp;
	        }
	    }
	 
	    static void reverseArray(char[] arr) {
	        for (int i = 0; i < arr.length / 2; i++) {
	            char temp = arr[i];
	            arr[i] = arr[arr.length - 1 - i];
	            arr[arr.length - 1 - i] = temp;
	        }
	    }

	    public static void main(String[] args)
	    {
	        FastReader sc = new FastReader();
	        
	    
	        
	        
	        
	        int t=sc.nextInt();
	        while(t-->0) {
	        
	        int n=sc.nextInt();
	        
//	        int arr[]=new int[n];
//	        
//	        for(int i=0;i<n;i++) {
//	        	arr[i]=sc.nextInt();
//	        }
	        
	        if(n%2==0) {
	        	
	        	 for(int i=1;i<=n;i+=2) {
	        		 System.out.print((i+1)+" "+i+" ");
	 	        
	        	 }
	 	        	
	        	
	        	
	        	
	        	
	        }
	        else {
	        	int i=1;
	        	while(i<n-2) {
	        		System.out.print((i+1)+" "+i+" ");
	        		i+=2;
	        	}
	        	System.out.print(n+" "+i+" ");
	        	System.out.print((i+1));
	        	
	        	
	        	
	        }
	        
	        
	        
	        System.out.println();

	        	
	        	
	        	
	        	
	        	
	        	
	        	
	        	
	        	
	   
	       
	       
	        }
	     
	    }
	    
	    static long number(int n, int digit) {
	    	
	    	long var=0;
	    	
	    	for(int i=0;i<digit;i++) {
	    		var+=n;
	    		var*=10;
	    	}
	    	var/=10;
	    	return var;
	    	
	    } 
	        
	 	
	    static int binary(int start,int end,int arr[],int v ) {
	 		int Q=0;
	 	    if (end <= start) 
	 	        { Q=(v >= arr[start])?  start : (start-1); }
	 	    else{
	 	  
	 	    int mid = (start + end)/2; 
	 	  
	 	    if(v == arr[mid]) 
	 	       return mid; 
	 	  
	 	    if(v >arr[mid]) {
	 	        Q= binary( mid+1, end,arr, v); }
	 	    else if(v <arr[mid]){
	 	    Q= binary( start, mid-1,arr, v); }}
	 	    return Q;
	 	}
	        	 
 




       
       
   
    
     static boolean isCycle(boolean vis[], ArrayList<ArrayList<Integer>> adj,int v,int parent)
    {
        vis[v]=true;
        
        
        for(int i:adj.get(v)){
            if(vis[i]&&parent!=i){
                return true;
            }
            else if(vis[i]){
                continue;
            }
            boolean a= isCycle(vis,adj,i,v);
            if(a)return true;
            
            
        }
        return false;
        
    }
}