#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

#define ull unsigned long long
#define MOD 9973

ull T,n;

bool ciur[1000005];

ull Prim[1000005],P;

ull putere (ull baza,ull exponent)
{
    ull sol=1,p;
    for (p=1;p<=exponent;p*=2)
    {
        if (p&exponent)
        {
            sol=(sol*baza)%MOD;
        }
        baza=(baza*baza)%MOD;
    }
    return sol;
}

int main()
{
    ull i,j;
    ciur[1]=1;
    for (i=2;i<=1000000;++i)
    {
        if (ciur[i]==0)
        {
            ++P;
            Prim[P]=i;
            for (j=i*i;j<=1000000;j=j+i)
            {
                ciur[j]=1;
            }
        }
    }
    /// 0 = DA (e prim)
    /// 1 = NU (nu e prim)
    fin >> T;
    for (i=1;i<=T;++i)
    {
        fin >> n;
        ull rez1=1,rez2=1;
        for (j=1;j<=P && Prim[j]*Prim[j]<=n;++j)
        {
            if (n%Prim[j]==0)
            {
                ull contor=0;
                while (n%Prim[j]==0)
                {
                    n/=Prim[j];
                    ++contor;
                }
                rez1*=(contor+1);
                ull p1=(putere(Prim[j],contor+1)-1)%MOD;
                ull p2=putere(Prim[j]-1,MOD-2)%MOD;
                rez2=(((rez2*p1)%MOD)*p2)%MOD;
            }
        }
        if (n>1)
        {
            rez1*=2;
            rez2=(rez2*(n+1))%MOD;
        }
        fout << rez1 << " " << rez2 << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}