#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include<stdlib.h>
using namespace std;
int n,q,el,l,r,v[100001],ind,max1;
long long count2;
int i,j,T;
vector<int> pozitii[2];
int main()
{
    ifstream f("consecutive.in");
    ofstream g("consecutive.out");

    f>>T;
    for(i=1;i<=T;i++)
    {
        f>>n;
        for(j=2;(j*(j+1))/2 <= n;j++)
        {
            if(j%2==0 && n%j==j/2 && n/j-j/2>=0)
            {
                pozitii[0].push_back(n/j-j/2+1);
                pozitii[1].push_back(n/j+j/2);
            }
            if(j%2==1 && n%j==0 && n/j-j/2>0)
            {
                pozitii[0].push_back(n/j-j/2);
                pozitii[1].push_back(n/j+j/2);
            }
        }
        q = pozitii[0].size();
        g<<q<<"\n";
        for(j=0;j<q;j++)
            g<<pozitii[0][j]<<" "<<pozitii[1][j]<<"\n";
        g<<"\n";
    }
    return 0;
}