#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define mod 1000000007
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define ull unordered_map<ll, ll>
#define usl unordered_map<string, ll>
#define um unordered_map
#define pll pair<ll, ll>
using namespace std;
void solve();
string conc(ll a, ll b) { return to_string(a) + "|" + to_string(b); }
ll rev(ll x){ ll ans = 0; while (x != 0) { ans = ans * 10 + (x % 10); x /= 10; } return ans; }
ll numdig(ll x) { ll ans = 0; while (x != 0) { ans++; x /= 10; } return ans; }
void printvec(vector<ll> &v) { for (ll i = 0; i < v.size(); i++) cout << v[i] << " "; cout << endl; }
void printmat(vector<vector<ll>> &mat) { for (ll i = 0; i < mat.size(); i++) { for (ll j = 0; j < mat[0].size(); j++) cout << mat[i][j] << " "; cout << endl; } }

void solve(){
    ll n;
    cin>>n;
    if(n==3) cout<<"2\n3 2\n3 2\n";
    else if(n==4) cout<<"3\n3 4\n4 2\n4 2\n";
    else if(n<=8){
        cout<<n<<endl;
        for(ll i=3; i<n; i++) cout<<i<<" "<<n<<endl;
        ll curr = n;
        while(curr!=1){
            curr = ceil(1.0*curr/2);
            cout<<n<<" 2\n";
        }
    }
    else{
        cout<<n+5<<endl;
        for(ll i=1; i<=n; i++){
            if(i!=1 && i!=2 && i!=4 && i!=8 && i!=n) cout<<i<<" "<<n<<endl;
        }
        for(ll i=0; i<6; i++) cout<<n<<" 8\n";
        cout<<"8 4\n8 4\n4 2\n4 2\n";
    }
}

int main(void) {
    io
    ll t;
    t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}