#include <iostream>
#include <map>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
#include <vector>

#define DMAX 100001
#define ll long long

using namespace std;

vector <pair<ll, ll> > v;

void solve(ll n)
{
    for(ll i=1;i*(i+1)/2<=n;i++)
    {
        ll x=n-i*(i+1)/2;

        if(x%(i+1) == 0 && x!=0)
        {
            ll k=x/(i+1);
            v.push_back(make_pair(k, k+i));
        }
    }
    printf("%d\n", v.size());
    for(ll i=0;i<v.size();i++)
    printf("%lld %lld\n", v[i].first, v[i].second);

    v.clear();
}

int main()
{
    freopen("consecutive.in", "r", stdin);
    freopen("consecutive.out", "w", stdout);
ll T, n;
    scanf("%lld", &T);
    while(T--)
    {
        scanf("%lld", &n);
        solve(n);
    }

    return 0;
}