#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
const int MOD= 9973;
ll put(ll d, int e)
{   ll r=1;
    for(int i=1;i<=e;i++) r*=d;
    return r;
}
int t;
int main()
{   f>>t;
    while(t--)
    {   ll n;
        f>>n;
        if(n==1) g<<"1 1\n";
        else
        {   ll s=1,p=1;
            for(ll d=2;d*d<=n;d++)
            {   int e=1,prod=1;
                while(n%d==0) {n/=d; e++; prod*=d;}
                p=p*e%MOD;
                prod=prod*d-1;
                prod=(prod/(d-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;
}