#include <fstream>
#include <cmath>

#define upper 1000001

using namespace std;

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

bool prim[upper];

void Eratostene()
{
   int i,j;

   prim[2]=true;
   for(i=3; i<=upper; i=i+2) prim[i]=true;
   for(i=3; i*i<=upper; i=i+2)
    if(prim[i]==true)
    for(j=3*i; j<=upper; j=j+2*i) prim[j]=false;

}

int main()
{
  int t,i,j,k,exp;
  long long n,aux,nrdiv=1,sumdiv=1,sum;

  Eratostene();

  fin>>t;
  for(i=1; i<=t; i++)
  {
     fin>>n;

     if(prim[n]==true) fout<<'2'<<' '<<(n+1)%9973<<'\n';
     else
     {
       nrdiv=1;
       sumdiv=1;

       j=2;
       while(n>1)
         if(prim[j]==true && n%j==0)
       {
         exp=1;
         while(n%j==0) { exp++; n=n/j; }

         //fout<<j<<' '<<exp<<'\n';
         nrdiv=nrdiv*exp;

         aux=1;
         for(k=1; k<=exp; k++) aux=aux*j;
         //fout<<aux<<'\n';

         sumdiv=sumdiv*((aux-1)/(j-1));
         j++;
       }
         else j++;

       fout<<nrdiv<<' '<<sumdiv%9973<<'\n';
     }
  }


    return 0;
}