#include <fstream>
#include <iostream>
#include <cmath>
#define MOD 9973
#define NCIUR 2000000
using namespace std;

ifstream f("ssnd.in");
ofstream g("ssnd.out");

int n,T,ciur[2000005],prim[1000000],countP;

void goCiur()
{
    int i,j;
    for(i=2;i<=NCIUR;i++)
        if(!ciur[i])
        {
            prim[++countP]=i;
            for(j=2*i;j<=NCIUR;j=j+i)
                ciur[j]=1;
        }
}

int exp ( int x , int y )
{
    int rez=1;
    while(y)
    {
        if(y%2==0)
            x=(x*x)%MOD;
        else
        {
            rez=(rez*x)%MOD;
            x=(x*x)%MOD;
        }
        y/=2;
    }
    return rez;
}

int main()
{

    int i, nr, s, d, rad;
    f>>T;
    goCiur();
    while(T--)
    {
        f>>n;

        if( !ciur[n] )
        {
            nr = 2;
            s = n + 1;
        }
        else
        {

            nr=1, s=1;

            rad=int(sqrt(n));
            for(i=1;i<=rad;i++)
            {

                d=0;

                while(n%prim[i]==0)
                {
                    d++;
                    n/=prim[i];
                }

                d=d%MOD;
                nr=(nr*(d+1))%MOD;
                s=(s*(exp(prim[i],d+1)-1)/(prim[i]-1))%MOD;

            }

        }

        g<<nr<<' '<<s<<'\n';

    }

}