#include<iostream>
#include<fstream>
#include<algorithm>
#include<math.h>
using namespace std;
long n,countt;
long lower[100000], upper[100000];

int main(void){
  ifstream fin("consecutive.in");
  ofstream fout("consecutive.out");
  int t;
  fin>>t;
  while(t--){
    fin>>n;
    countt=0;
    long tmp,b,k,a;
    for(k=1;k<sqrt(2*n)+1;k++){
      if((2*n)%(k+1)==0){
	tmp=2*n/(k+1)-k;
	if(tmp%2==0&&tmp>0){
	  a=tmp/2;
	  b=a+k;
	  lower[countt]=a;
	  upper[countt++]=b;
	}
      }
    }
    fout<<countt<<"\n";
    for(int i=0;i<countt;i++)
      fout<<lower[i]<<" "<<upper[i]<<"\n";
  }
  fout.close();
  fin.close();
  
  return 0;
}