#include<bits/stdc++.h>
using namespace std;
const int N=200005;
int ans[N];
void solve(vector<int>v,int t){
    int n=v.size();
//    cerr<<"==> "<<n<<'\n';
  //  for(int i:v)cerr<<i<<' ';
    //cerr<<'\n';
    if(n==4){
        if(t==0){
            ans[v[0]]+=3;
            ans[v[1]]+=0;
            ans[v[2]]+=2;
            ans[v[3]]+=1;
        }
        else{
            ans[v[0]]+=1;
            ans[v[1]]+=2;
            ans[v[2]]+=0;
            ans[v[3]]+=3;
        }
        return;
    }
    int k=__lg(n-1);
    vector<int>a,b;
    for(int i=0;i<n-(1<<k);i++){
        if(i&1){
            a.push_back(v[i]);
            b.push_back(v[i+(1<<k)]);
            continue;
        }
        ans[v[i]]+=1<<k;
        ans[v[i+(1<<k)]]+=1<<k;
        b.push_back(v[i]);
        a.push_back(v[i+(1<<k)]);
    }
    for(int i=n-(1<<k);i<(1<<k);i++)
        a.push_back(i);
    solve(a,0);
    solve(b,1);
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=1;
    cin>>t;
	while(t--){
        int n;
        cin>>n;
        if(n%4){
            cout<<"No\n";
            continue;
        }
        cout<<"Yes\n";
        vector<int>v;
        for(int i=0;i<n;i++)ans[i]=0;
        for(int i=0;i<n;i++)v.push_back(i);
        solve(v,0);
        for(int i=0;i<n;i++)cout<<i<<' ';cout<<'\n';
        for(int i=0;i<n;i++)cout<<ans[i]<<' ';cout<<'\n';
	}
	return 0;
}