#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("ssnd.in");
ofstream fout ("ssnd.out");
const int mod = 9973;
const int nmax = 1000006;
bool ciur[nmax];
vector <int> p;
int power(int a, int b)
{
    int rez=1;
    a=a%mod;
    while(b)
    {
        if(b&1)
        {
            rez=rez*a;
            rez=rez%mod;
        }
        a=a*a;
        a=a%mod;
        b=b>>1;
    }
    return rez;
}
int main()
{
    int i, j, t, n, nd, sd, x, p1, p2;
    p.push_back(2);
    for(i=3; i<=nmax; i+=2)
        if(!ciur[i])
        {
            p.push_back(i);
            for(j=i+(i<<1); j<=nmax; j+=(i<<1)) ciur[j]=1;
        }


    fin >> t;
    while(t--)
    {
        fin >> n;
        nd=1, sd=1;
        for(i=0; i<p.size() && 1LL*p[i]*p[i]<=n; ++i)
        {
            if(n%p[i]) continue;
             x = 0;
            while(n%p[i]==0)
            {
                n=n/p[i];
                ++x;
            }
            nd=nd*(x+1);
            p1=(power(p[i], x+1) - 1)%mod;
            p2=power(p[i]-1, mod-2)%mod;
            sd=(((sd*p1)%mod)*p2)%mod;
        }
        if(n>1)
        {
            nd=nd<<1;
            sd=(1LL*sd*(n+1)%mod);
        }
        fout << nd << " " << sd << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}