#include <stdio.h>

using namespace std;

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

const int m(9973);
long long S,n,j,d,ndiv,N1,N2,i,t,p[1000000];
bool v[1000001];

long long pw(long long n,long long p)
{
    long long a,sol(1);
    a=n;
    for(int i=0;(1<<i)<=p;i++)
    {
        if((p&(1<<i))>0)
         sol=(sol*a)%m;
        a=(a*a)%m;
    }
    return sol;
}

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

int main()
{
    fscanf(f,"%d",&t);
    ciur();
    for(int i=1;i<=t;i++)
    {
        fscanf(f,"%lld",&n);
        j=1; S=1; ndiv=1;
        while(p[j]*p[j]<=n && n>1)
        {
            if(n%p[j]==0)
            {
                d=1;
                while(n%p[j]==0)
                {n/=p[j]; d++;}
                N1=(pw(p[j],d)-1)%m;
                N2=pw(p[j]-1,9971)%m;
                S=(S*N1*N2)%m;
                ndiv=ndiv*d;
            }
            j++;
        }
        if(n>1)
        {
            S=(S*((n+1)%m)%m);
            ndiv*=2;
        }
        fprintf(g,"%lld %lld\n",ndiv,S);
    }
    return 0;
}