#include <bits/stdc++.h>

#include<fstream>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
long long test,n[51];
long long k;
int main()
{
    fin>>test;
    for(int i=1;i<=test;i++) {
        fin>>n[i];
        int x=sqrt(2 * n[i]);
        int counter = 0;
        for(k=2;k<=x;k++)
        {
            if((2*n[i])%k==0)
                if(((2*n[i])/k-k+1)%2==0)
                    counter += 1;
        }
        fout << counter << "\n";
        for(k=2;k<=x;k++)
        {

            if((2*n[i])%k==0)
                if(((2*n[i])/k-k+1)%2==0)
                    fout<<((2*n[i])/k-k+1)/2<<" "<<((2*n[i])/k-k+1)/2 + k - 1<<endl;
        }}
    return 0;
}