#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long long lint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = 200005;

const int a4[4] = {0, 2, 1, 3};
const int b4[4] = {3, 2, 0, 1};

const int a8[8] = {0, 1, 2, 3, 4, 5, 6, 7};
const int b8[8] = {0, 2, 4, 6, 3, 1, 7, 5};

int a[N], b[N];

void construct(int X, int I) {
    if (X == 4) {
        for (int i=0;i<4;i++) {
            a[I+i] = a4[i];
            b[I+i] = b4[i];
        }
        return;
    }
    if (X == 8) {
        for (int i=0;i<8;i++) {
            a[I+i] = a8[i];
            b[I+i] = b8[i];
        }
        return;
    }
    int chunk = X/4;
    for (int i=0;i<4;i++) {
        construct(chunk, i*chunk);
        for (int j=i*chunk;j<(i+1)*chunk;j++) {
            a[j] = 4 * a[j] + a4[i];
            b[j] = 4 * b[j] + b4[i];
        }
    }
}

void solve() {
    int n;
    scanf("%d",&n);
    if(n <= 2 || ((n & (-n)) != n)) {
        puts("No");
        return;
    }
    puts("Yes");
    construct(n, 0);
    for (int i=0;i<n;i++) {
        printf("%d ", a[i]);
    }
    puts("");
    for (int i=0;i<n;i++) {
        printf("%d ", b[i]);
    }
    puts("");
}

int main()
{
    // ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc;
    scanf("%d",&tc);
    while(tc--) {
        solve();
    }
}