https://codeforces.com/contest/2072/problem/E
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
using pii = pair<int, int>;
const double PI = acos(-1);
const int N =550;
const int mod = 1e9 + 7;
int sum[N];
void solve(){
int k;cin>>k;
vector<int> v;
int cnt=0;
while(k>0){
int n=1;
while((n)*(n+1)/2<=k){
n++;
}
v.push_back(n);
cnt+=n;
k-=n*(n-1)/2;
}
cout<<cnt<<endl;
int x=0;
for(int i=0;i<v.size();i++){
for(int j=0;j<v[i];j++){
cout<<x<<" "<<i<<endl;
x++;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
int T = 1;
cin>>T;
while (T--) {
solve();
}
return 0;
}