#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

//#define ENVIRONMENT_LINKED_ACL

#ifdef ENVIRONMENT_LINKED_ACL
#include <atcoder/convolution>
#include <atcoder/lazysegtree>
#include <atcoder/segtree.hpp>
#endif

//#define ENVIRONMENT_LINKED_BOOST

#ifdef ENVIRONMENT_LINKED_BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#endif

using namespace std;
using uint = unsigned int;
using ll   = long long;
using ull  = unsigned long long;
#define REP(i, a, b)    for (ll i = a; i < b; ++i)
#define REPREV(i, a, b) for (ll i = a; i > b; --i)

const int _ = []() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
    return 0;
}();

template <typename value_t>
void resize(value_t& v, const value_t& val) { v = val; }
template <typename vec_t, typename value_t, typename... arg_t>
void resize(std::vector<vec_t>& v, const value_t& val, int size, arg_t... arg) {
    v.resize(size);
    for (auto& c : v) resize(c, val, arg...);
}

template <typename A, typename B>
void chmin(A& a, const B& b) {
    a = min(a, static_cast<A>(b));
};
template <typename A, typename B>
void chmax(A& a, const B& b) {
    a = max(a, static_cast<A>(b));
};

int main() {
    ll t;
    cin >> t;
    while (t--) {
        ll n;
        cin >> n;
        if (n == 2) {
            cout << "1\n2 1\n1\n2 1" << endl;
            continue;
        }
        if (n == 3) {
            cout << "5\n2 3 1\n2\n1 3\n2 3" << endl;
            continue;
        }

        ll l   = n / 2;
        ll r   = n / 2 + 1;
        ll ans = 0;
        vector<pair<int, int>> op;
        REP(i, r, n) {
            ans += (i - 1) * (i - 1);
            op.push_back({i, 1});
        }
        REPREV(i, l, 0) {
            ans += (n - i) * (n - i);
            op.push_back({i, n});
        }
        cout << ans << endl;
        cout << r << " ";
        REP(i, 1, n + 1) {
            if (i == l || i == r) continue;
            cout << i << " ";
        }
        cout << l << endl;
        cout << op.size() << endl;
        for (auto p : op) {
            cout << p.first << " " << p.second << endl;
        }
    }

    return 0;
}
