//qoj6978
#include <bits/stdc++.h>
using namespace std;

const int N = 100;
int T, x[N], y[N], tp;
typedef long long ll;
ll q;

int main(){
    scanf("%d", &T);
    while(T--){
        scanf("%lld", &q);
        tp = 0;
        if(q == 1){
            puts("0");
            continue;
        }
        ll p = 1;
        ++ tp;
        x[tp] = y[tp] = 1;
        while(p * 2 <= q){
            ++ tp;
            x[tp] = 1;
            y[tp] = tp;
            p *= 2;
        }
        if(q != p){
            int nw = tp;
            for(int i = 0; i < 61; ++ i){
                if((q >> i) & 1){
                    ++ tp;
                    x[tp] = 1;
                    y[tp] = i + 1;
                }
            }
            ++ tp;
            x[tp] = nw+2;
            y[tp] = tp;
        }
        printf("%d\n", tp);
        for(int i = 1; i <= tp; ++ i){
            printf("%d %d\n", x[i], y[i]);
        }
    }
    return 0;
}