#include <bits/stdc++.h>

void print_identity(int n) {
	for (int i = 0; i < n; i++)
		std::cout << i << " ";
	std::cout << "\n";
}

int main() {
    int t;
	std::cin >> t;

	while (t--) {
		int n;
		std::cin >> n;
		
		if (n == 1) {
			std::cout << "Yes\n0\n0\n";
			continue;
		}

		if (n == 2) {
			std::cout << "No\n";
			continue;
		}

		if (n % 12 == 0 && ((n / 12) & (n / 12 - 1)) == 0) {
			std::cout << "Yes\n";
			print_identity(n);
			for (int i = 0; i < n / 3; i++)
				std::cout << n / 3 + i * 2 << " ";
			for (int i = 0; i < n / 3; i++)
				std::cout << 2 * i + 1 << " ";
			for (int i = 0; i < n / 6; i++)
				std::cout << i * 2 << " ";
			for (int i = 0; i < n / 6; i++)
				std::cout << (((n - n / 3) + 2 * i + 1) ^ 2) << " ";
			std::cout << "\n";
			continue;
		}

		if ((n & (n - 1)) != 0) {
			std::cout << "No\n";
			continue;
		}

		std::cout << "Yes\n";
		print_identity(n);
		for (int i = 0; i < n / 2; i++)
			std::cout << i * 2 << " ";
		for (int i = 0; i < n / 2; i++) {
			std::cout << ((i * 2 + 1) ^ 2) << " ";
		}
		std::cout << "\n";
	}

	return 0;

	int n;
    std::cin >> n;
	//n = 24;

    std::vector<int> pa, pb, res;
    for (int i = 0; i < n; i++) {
        pa.push_back(i);
		res.push_back(i);
    }
			
	for (int i = 0; i < n / 3; i++)
		pb.push_back(n / 3 + i * 2);
	for (int i = 0; i < n / 3; i++)
		pb.push_back(2 * i + 1);
	for (int i = 0; i < n / 6; i++)
		pb.push_back(i * 2);
	for (int i = 0; i < n / 6; i++)
		pb.push_back((((n - n / 3) + 2 * i + 1) ^ 2));

    //pb = {8, 10, 12, 14, 16, 18, 20, 22, 1, 3, 5, 7, 9, 11, 13, 15, 0, 2, 4, 6, 17, 19, 21, 23};

	//for (int i = 0; i < n / 2; i++) {
	//	pb[i] = i * 2;
	//	pb[i + n / 2] = (i * 2 + 1) ^ 2;
	//}

    do {
        std::vector<int> pc;
        for (int i = 0; i < n; i++)
            pc.push_back(pa[i] ^ pb[i]);

        std::sort(pc.begin(), pc.end());
        bool ok = (pc == res);

        if (ok) {
			std::vector<int> aux = pb;
			std::sort(aux.begin(), aux.end());

			assert(aux == res);

			std::cerr << "Found solution!\n";
            for (int i = 0; i < n; i++)
                std::cerr << pa[i] << " ";
            std::cerr << "\n";
            for (int i = 0; i < n; i++)
                std::cerr << pb[i] << " ";
            std::cerr << "\n";
			return 0;
        }

    } while (std::next_permutation(pb.begin(), pb.end()));

    std::cerr << "No solution\n";

    return 0;
}