#include <iostream>
#include <fstream>
#include <cmath>
#define M 9973
using namespace std;

bool prim[1000001];
long primlist[79000];
int modinv[9973];
ofstream g("ssnd.out");

void dioph(int a, int b, int& alpha, int& beta)
{
    int r=a%b, alpha_p, beta_p;
    if (r==0)
    {
        alpha=0;
        beta=1;
        return;
    }
    else
    {
        dioph(b, r, alpha_p, beta_p);
        alpha=beta_p;
        beta=alpha_p-beta_p*(a/b);
        return;
    }
}

void precalc()
{
    int i, j, alpha, beta;
    primlist[1]=2;
    primlist[0]=1;
    for (i=2;i<1000001;i+=2)
        prim[i]=1;
    for (i=3;i<1000001;i+=2)
    {
        if (prim[i]==0)
            primlist[++primlist[0]]=i;
        else
            continue;
        if (i>1000)
            continue;
        for (j=i*i;j<1000001;j+=i)
            prim[j]=1;

    }
    for (int i=1;i<9973;i++)
    {
        if (modinv[i])
            continue;
        dioph(i, M, alpha, beta);
        while (alpha<0)
            alpha+=M;
        modinv[i]=alpha;
        modinv[alpha]=i;
    }
    //for (int i=1;i<9973;i++)
    //    cout<<modinv[i]<<' ';
}



void solve(long long N)
{
    //cout<<"The factorization of "<<N<<" is: ";
    long p=1, s=1, lim=sqrt(N), d, dv;
    for (int i=1;i<=primlist[0] && i<=lim;i++)
    {
        if (N%primlist[i])
            continue;
        //cout<<primlist[i];
        d=0, dv=primlist[i];
        while (N%primlist[i]==0)
        {
            d++;
            N/=primlist[i];
            dv=(dv*primlist[i])%M;
        }
        //cout<<'^'<<d<<' ';
        //cout<<'('<<dv-1<<' '<<modinv[primlist[i]-1]<<") ";
        p=(p*(d+1))%M;
        s=(s*(dv-1))%M;
        s=(s*modinv[(primlist[i]-1)%M])%M;
    }
    if (N>1)
    {
        p=(2*p)%M;
        s=(s*(N+1))%M;
        //cout<<N<<' ';
    }
    //cout<<'\n';
    g<<p<<' '<<s<<'\n';
}

void read()
{
    long T;
    long long N;
    ifstream f("ssnd.in");
    f>>T;
    while (T--)
    {
        f>>N;
        solve(N);
    }
}

int main()
{
    precalc();
    read();

}