#include <cstdio>
#include <vector>
using namespace std;

int nrt;
long long n;

int main() {
    freopen("consecutive.in", "r", stdin);
    freopen("consecutive.out", "w", stdout);

    scanf("%d", &nrt);

    while(nrt--) {
        scanf("%lld", &n);

        vector < pair<int, int> > sol;
        for(long long lg = 2; lg * (lg + 1) / 2 <= n; ++lg) {
            if((2 * n - (lg - 1) * lg )% (2 * lg) == 0) {
                int a = (2 * n - (lg - 1) * lg) / (2*lg);
                sol.push_back(make_pair(a, a + lg - 1));
            }
        }

        printf("%d\n", (int) sol.size());
        for(auto x: sol)
            printf("%d %d\n", x.first, x.second);
    }


    return 0;
}