You are given an array a consisting of n integers (it is guaranteed that n is even, i.e. divisible by 2). All a_i does not exceed some integer k.

Your task is to replace the minimum number of elements (replacement is the following operation: choose some index i from 1 to n and replace a_i with some integer in range [1; k]) to satisfy the following conditions:

  * after all replacements, all a_i are positive integers not greater than k; 
  * for all i from 1 to n/2 the following equation is true: a_i + a_{n - i + 1} = x, where x should be the same for all n/2 pairs of elements. 



You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains two integers n and k (2 ≤ n ≤ 2 ⋅ 10^5, 1 ≤ k ≤ 2 ⋅ 10^5) — the length of a and the maximum possible value of some a_i correspondingly. It is guratanteed that n is even (i.e. divisible by 2). The second line of the test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ k), where a_i is the i-th element of a.

It is guaranteed that the sum of n (as well as the sum of k) over all test cases does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5, ∑ k ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer — the minimum number of elements you have to replace in a to satisfy the conditions from the problem statement.

Example

Input


4
4 2
1 2 1 2
4 3
1 2 2 1
8 7
6 1 1 7 6 3 4 6
6 6
5 2 6 1 3 4


Output


0
1
4
2
import java.io.*;
import java.util.*;
import java.awt.*;
public class D
{
    BufferedReader in;
    PrintWriter ob;
    StringTokenizer st;
  
    public static void main(String[] args) throws IOException {
        new D().run();
    }
    void run() throws IOException {
        in=new BufferedReader(new InputStreamReader(System.in));
        ob=new PrintWriter(System.out);
        int t = ni();
        while(t-->0)
            solve();
        ob.flush();
    }
    void solve() throws IOException {
        int n = ni();
        int k = ni();
        int a[] = nia(0 , n);
    
        HashMap<Integer , Integer> hm = new HashMap<>(); 
        int dp[] = new int[2*k+5];
        for(int i=0 ; i<n/2 ; i++) {
            int sum=a[i]+a[n-i-1];
            hm.put( sum , hm.getOrDefault( sum , 0 ) + 1 );
 
            int x1 = sum - Math.max( a[i]-1 , a[n-i-1]-1 );
            int x2 = sum + Math.max( k - a[i] , k - a[n-i-1] );
 
            dp[x1]+=1;
            dp[sum]-=1;
            dp[sum+1]+=1;
            dp[x2+1]-=1;
        }
 
        for(int i=1 ; i<2*k+5 ; i++)
            dp[i]+=dp[i-1];
 
        int ans = Integer.MAX_VALUE;
        for(int x=2 ; x<=k+k ; x++) {
            int alreadyPresent = hm.getOrDefault(x,0);
            int needOneChange = dp[x];
            int needTwoChanges = n - (needOneChange*2) - (alreadyPresent*2);
            
            ans = Math.min( ans , needOneChange + needTwoChanges );
        }
 
        ob.println(ans);
    }
 
    String ns() throws IOException {
        return nextToken();
    }
    long nl() throws IOException {
        return Long.parseLong(nextToken());
    }
    int ni() throws IOException {
        return Integer.parseInt(nextToken());
    }
    double nd() throws IOException {
        return Double.parseDouble(nextToken());
    } 
    String nextToken() throws IOException {
        if(st==null || !st.hasMoreTokens())
            st=new StringTokenizer(in.readLine());
        return st.nextToken();
    }
    int[] nia(int start,int b) throws IOException {
        int a[]=new int[b];
        for(int i=start;i<b;i++)
            a[i]=ni();
        return a;
    }
    long[] nla(int start,int n) throws IOException {
        long a[]=new long[n];
        for (int i=start; i<n ;i++ ) {
            a[i]=nl();
        }
        return a;
    }
    
    public void tr(Object... o) {
     System.out.println(Arrays.deepToString(o));
    }
}