#include<iostream.h>
#include<fstream.h>
#include<math.h>
#define N 1000000
int test,u;
long long n,s,nr,t,i,j,p[N]={0},k,x[N];

long long put(long long x,long long n)
{if(n==0)
      return 1;
if(n%2==0)
      return put(x,n/2)*put(x,n/2);
else
      return x*put(x,(n-1)/2)*put(x,(n-1)/2);}

void sieve(long long x[N],long long *k,long long p[N])
{long i;
for(i=2;i<=N;i++)
if(p[i]==0)
      {x[++(*k)]=i;
      for(j=i+i;j<=N;j+=i)
            p[j]=1;}}

int main()
{fstream f1("ssnd.in",ios::in);
fstream f2("ssnd.out",ios::out);
f1>>test;
k=0;
sieve(x,&k,p);
for(u=1;u<=test;u++)
     {f1>>n;
     j=0;
     t=n;
     i=1;
     s=1;
     nr=1;
     while(t!=1&&x[i]<=sqrt(n))
           {while(t%x[i]==0)
                  {j++;
                  t/=x[i];
                  if(t==1)
                         {nr=nr*(j+1);
                         if(j==1)
                               s=(s*((x[i]+1)%9973))%9973;
                         else
                               s=(s*(((put(x[i],j+1)-1)/(x[i]-1))%9973))%9973;
                         j=0;}}
           if(j!=0)
                  {nr=nr*(j+1);
                  if(j==1)
                         s=(s*((x[i]+1)%9973))%9973;
                  else
                         s=(s*(((put(x[i],j+1)-1)/(x[i]-1))%9973))%9973;
                  j=0;}
           i++;}
     if(t!=1)
           {nr=nr*2;
           s=(s*((t+1)%9973))%9973;}
     if(s==1)
           {nr=2;
           s+=n;}
     f2<<nr<<" "<<(s%9973)<<endl;}
f1.close();
f2.close();
return 0;}