#include <stdio.h>
#define maxl 1000010
#include <bitset>


using namespace std;
FILE *f=fopen("ssnd.in","r");
FILE *g=fopen("ssnd.out","w");

long long i,j,t,p,b[maxl];
long long  nrd,sd;
bitset<maxl>cr;
long long a1,a2,x;
const int mod=9973;

void ciur()
{
 int i,j;
    b[0]=1;
    b[1]=2;
 for(i=3;i<=1001;i+=2)
  if (cr[i]==0)
  {
   b[b[0]++]=i;
   for(j=i+i;j<=1000001;j+=i)
    cr[j]=1;
  }
  for(i=1001;i<=1000001;i+=2)
    if(cr[i]==0) b[++b[0]]=i;
}

long long ridic (long long  n,long long  k)
{
 long long i,a=n,p=1;
 for(i=0;(1<<i)<=k;i++)
 {
 if (((1<<i)& k)>0) p=(p*a)%mod;
 a=(a*a)%mod;
 }
 return p;
}

int main()
{
fscanf(f,"%d",&t);
ciur();
for(i=1;i<=t;i++)
{
fscanf(f,"%lld",&x);
nrd=1;
sd=1;
j=2;
while(b[j]*b[j]<=x && x>1)
  {
    if(x%b[j]==0)
    {
        p=0;
        while(x%b[j]==0){p++;x=x/b[j];}
        nrd*=(p+1);
        a1=(ridic(b[j],p+1)-1)%mod;
        a2=(ridic(b[j]-1,mod-2))%mod;
        sd=((sd)*(a1*a2))%mod;
    }
   j++;
  }
if (x!=1)
 {
  nrd*=2;
  sd=((sd%mod)*(x+1))%mod;
 }

 fprintf(g,"%lld %lld\n",nrd,sd);
}

fclose(g);
return 0;
}