/* Problem URL: https://codeforces.com/problemset/problem/2035/C */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n;
    cin >> n;

    if (n == 5) {
        cout << "5\n";
        cout << "2 1 3 4 5\n";
        return;
    }

    int log = (1 << (32 - __builtin_clz(n))) - 1;

    vi apt(__builtin_popcount(log) << 1);
    apt[0] = 1;
    apt[1] = 5;

    for (int i = 2; i < apt.size(); i += 2) {
        apt[i] = 1 << (i >> 1);
        apt[i + 1] = (1 << ((i >> 1)) + 1) - 1;
    }

    while (apt.back() > n) {
        apt.pop_back();
    }

    set<int> all;
    rep(i, n) {
        all.insert(i + 1);
    }

    vi perm(n);
    int ans = log;
    int start = n - apt.size();
    int lim = n;
    if (n & 1) {
        if (n != log) {
            start--;
            lim--;
        }

        perm[n - 1] = n;
        all.erase(n);
        ans = n;
    }

    cout << ans << '\n';

    nrep(i, start, lim) {
        perm[i] = apt[i - start];
        all.erase(perm[i]);
    }

    rep(i, n) {
        if (all.empty()) {
            break;
        }

        perm[i] = *all.begin();
        all.erase(all.begin());
    }

    cout << perm;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}