#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
const int MOD= 9973;
int t,nr,v[1000005];
ll w[80000];
ll put(ll d, int e)
{   ll r=1;
    for(int i=1;i<=e;i++) r*=d;
    return r;
}
int main()
{   v[0]=v[1]=1;
    for(int i=2;i<=1000;i++)
        if(v[i]==0) for(int j=2;j<=1000000/i;j++) v[i*j]=1;
    w[1]=2; nr=1;
    for(int i=3;i<=1000000;i+=2)
        if(v[i]==0) w[++nr]=i;
    f>>t;
    while(t--)
    {   ll n;
        f>>n;
        if(n==1) g<<"1 1\n";
        else
        {   ll s=1,p=1;
            for(int i=1;w[i]*w[i]<=n;i++)
            {   int e=1,prod=1;
                while(n%w[i]==0) {n/=w[i]; e++; prod*=w[i];}
                p=p*e%MOD;
                prod=prod*w[i]-1;
                prod=(prod/(w[i]-1))%MOD;
                s=(s*prod)%MOD;
            }
            if(n>1) {p=(p*2)%MOD; s=s*(n+1)%MOD;}
            g<<p<<' '<<s<<'\n';
        }
    }
    g.close();
    f.close();
    return 0;
}
/*
V[0] ← 1
V[1] ← 1
pentru i ← 2,sqrt(n) execută
    dacă V[i] = 0 atunci
        pentru j ← 2, [n/i] execută
            V[i*j] ← 1
        sf_pentru
    sf_dacă
sf_pentru
*/