#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
#define range basic_string_view
using namespace std; typedef long long ll;
constexpr int mod=1e9+7,B=6;
inline int qpow(int x,int y){int res=1;while(y){if(y&1)res=1ll*res*x%mod;x=1ll*x*x%mod;y>>=1;}return res;}
bitset<mod> vis; int val[205],ival[205]; vector<int> lis[205],lis2[205];
bool solve(int o,int n){
    o=1ll*o*qpow(n,mod-2)%mod*qpow(n-1,mod-2)%mod;
    debug(o,n);
    for(int i=0,t=1;i<=n-2;i++) val[i]=t,t=1ll*t*(n-2-i)%mod;
    For(i,0,n-2) ival[i]=qpow(val[i],mod-2);
    For(i,0,n-2) lis[i].clear(),lis2[i].clear();
    function<void(int,int,int)> dfs1=[&](int d,int tot,int x){
        lis[tot].push_back(x);
        For(i,d,min(B,n-2-tot)) dfs1(i,tot+i,1ll*x*ival[i]%mod);
    };
    function<void(int,int,int)> dfs2=[&](int d,int tot,int x){
        lis2[tot].push_back(x);
        For(i,d,n-2-tot) dfs2(i,tot+i,1ll*x*val[i]%mod);
    };
    dfs1(1,0,o); dfs2(B+1,0,1);
    For(s,0,n-2){
        for(int x:lis[s]) vis.set(x);
        int X=0;
        for(int x:lis2[n-2-s]) if(vis.test(x)) { X=x; break; }
        for(int x:lis[s]) vis.reset(x);
        if(!X) continue;
        vector<int> ans;
        function<bool(int,int,int)> dfs3=[&](int d,int tot,int x){
            if(tot==s&&x==X) return true;
            For(i,d,min(B,n-2-tot)){
                ans.push_back(i); if(dfs3(i,tot+i,1ll*x*ival[i]%mod)) return true; else ans.pop_back();
            }
            return false;
        };
        function<bool(int,int,int)> dfs4=[&](int d,int tot,int x){
            if(tot==n-2-s&&x==X) return true;
            For(i,d,n-2-tot){
                ans.push_back(i); if(dfs4(i,tot+i,1ll*x*val[i]%mod)) return true; else ans.pop_back();
            }
            return false;
        };
        assert(dfs3(1,0,o)); assert(dfs4(B+1,0,1));
        ans.resize(n); debug(ans);
        cout<<n<<'\n';
        for(int i=1,p=2;i<=n;i++){
            For(_,1,ans[i-1]+(i==1)) cout<<i<<' '<<p++<<'\n';
        }
        return true;
    }
    return false;
}
signed main(){
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    int T; cin>>T; while(T--) { int o; cin>>o; if(o==1) { cout<<1<<'\n'; continue; }; int n=2; while(!solve(o,n)) n++; }
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE

// Started Coding On: October 28 Sat, 07 : 43 : 27