#include <cstdio>
#define MOD 9973
#define N 1000000
using namespace std;
bool v[N+1];
int a[N/2],k=0;
int divizori(int &s,int &e,long long x)
{
    int p;
    s=e=1;
    long long  y;
    for(int i=0;i<k && 1LL*a[i]*a[i]<=x;i++)
    {

        if(x%a[i])
            continue;
        p=1;
        y=a[i];
            while(x%a[i]==0)
            {x=x/a[i];
            y*=a[i];
            p++;}
        e*=p;
        s=(s*((y-1)/(a[i]-1)))%MOD;
    }
    if(x>1)
    {
        e*=2;
        s=(1LL*s*(x+1))%MOD;
    }
}
int main()
{
    int t,s,e;
    long long  n;
    for(int i=2;i<=N;i++)
    {
        if(v[i]==0)
        {
            a[k++]=i;
            for(int j=2;j*i<=N;j++)
                v[j*i]=1;
        }
    }
    freopen("ssnd.in","r",stdin);
    freopen("ssnd.out","w",stdout);
    scanf("%d",&t);

    for(int i=0; i<t; i++)
        {
        scanf("%lld",&n);
        divizori(s,e,n);
        printf("%d %d\n",e,s);
        }


}