#include <cstdio>
#include <bitset>
using namespace std;
long long n,a[100000],x,i,j,m,t,k,d,c,nr,sum,put,mod;
bitset<1000005>ciur;
int main()
{
    freopen("ssnd.in","r",stdin);
    freopen("ssnd.out","w",stdout);
    scanf("%lld",&t);
    for(i=2;i<=1000000;i++)
        if(ciur[i]==0)
    {
        m++;
        a[m]=i;
        for(j=i*i;j<=1000000;j+=i)
            ciur[j]=1;
    }
    mod=9973;
    for(k=1;k<=t;k++)
    {
        scanf("%lld",&n);
        d=1;
        nr=1;
        sum=1;
        x=n;
        while(n!=1)
        {
            c=0;
            put=1;
            while(n%a[d]==0)
            {
                c++;
                n/=a[d];
            }
             nr*=(c+1);
             c++;
             while(c>0)
             {
                 put*=a[d];
                 c--;
             }
             sum*=((put-1)/(a[d]-1))%mod;
             d++;
             if(a[d]*a[d]>n&&n>1&&nr==1) {nr*=2; sum=(1+x)%mod; break;}

        }
        printf("%lld %lld\n",nr,sum);
    }


    return 0;
}