# include <fstream>
# include <algorithm>
# include <bitset>
# include <cmath>
# define N_Max 1000000
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bitset <1000005> p;
int a[200000];
int i,j,k,n,VV,d,ndiv,suma,x,nr,ap,inm,X;
int putere (int w, int q)
{
    int QQ=1;
    while (q!=0)
    {
        if (q%2==1)
        {
            QQ=QQ*w;
            --q;
        }
        else
        {
            w=w*w;
            q=q/2;
        }
        w=w%9973;
        QQ=QQ%9973;
    }
    return QQ;
}
int main ()
{
    a[1]=2;
    k=1;
    for (i=3; i<=N_Max; i=i+2)
    {
        if (p[i]==0)
        {
            a[++k]=i;
            for (j=3; i*j<=N_Max; j=j+2)
                p[i*j]=1;
        }
    }
    f>>n;
    for (i=1; i<=n; ++i)
    {
        f>>x; X=x;
        if (x==1)
        {
            g<<"1 1\n";
            continue;
        }
        VV=1; nr=0; ndiv=1; suma=1;
        while (a[VV]*a[VV]<=X && x!=1)
        {
            if (x%a[VV]==0)
            {
                ap=0;
                while (x%a[VV]==0)
                {
                    ++ap;
                    x=x/a[VV];
                }
                ndiv=ndiv*(ap+1);
                inm=putere(a[VV],ap+1);
                suma=((suma*(inm-1))%9973/(a[VV]-1))%9973;
            }
            ++VV;
        }
        if (x>1)
        {
            g<<"2 "<<x+1<<"\n";
            continue;
        }

        g<<ndiv<<" "<<suma<<"\n";
    }

    return 0;
}