#include <cstdio>
#include <bitset>
using namespace std;
long long n,a[500005],x,i,j,m,t,k,d,c,nr,sum,put,mod,e,b;
bitset<1000005>ciur;
int ridic(long n,int p)
{
    long long a;
    a=1;
    while(p!=0)
    {
        if(p%2!=0)
        {
            a =a*n;
            p--;
        }
        n=n*n;
        p = p/2;

    }
    return a;
}
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;
        for(i=1;i<=m&&a[i]*a[i]<=n;i++)
        {
            c=0;
            while(n%a[i]==0)
            {
                n/=a[i];
                c++;
            }
            if(c>0)
            {
              nr*=(c+1);
             put=ridic(a[i],c+1);
             sum=(sum*((put-1)/(a[i]-1)))%mod;
            }
        }
        if(n>1)
        {
            nr*=2;
            sum=(sum*(n*n-1)/(n-1))%mod;
        }

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


    return 0;
}