#include <algorithm>
#include <vector>
#include <bitset>
using namespace std;

#define pb push_back
#define MAX 1000005
#define MOD 9973

vector <int> prim;
bitset <MAX> viz;
long long n;
int t,nd,sd;

void ciur ()
{
    int i,j;

    for (i=2; i<MAX; ++i)
        if (!viz[i])
        {
            prim.pb (i);
            for (j=i; j<MAX; j+=i)
                viz[j]=1;
        }
}

int lgput (int n,int p)
{
    int rez;

    n%=MOD;
    for (rez=1; p; p>>=1)
    {
        if (p&1)
            rez=(rez*n)%MOD;
        n=(n*n)%MOD;
    }

    return rez;
}

void solve ()
{
    int i,exp,prod;

    nd=sd=1;
    for (i=0; (long long)prim[i]*prim[i]<=n; ++i)
        if (n%prim[i]==0)
        {
            for (exp=0, prod=1; n%prim[i]==0; n/=prim[i])
            {
                ++exp;
                prod*=prim[i];
            }
            nd=(nd*(exp+1))%MOD;
            sd=((sd*((long long)prim[i]*prod-1))%MOD*lgput (prim[i]-1,MOD-2))%MOD;
        }
    if (n>1)
    {
        nd=(nd*2)%MOD;
        sd=((sd*(lgput (n,2)+MOD-1))%MOD*lgput (n-1,MOD-2))%MOD;
    }
    printf ("%d %d\n",nd,sd);
}

int main ()
{
    freopen ("ssnd.in","r",stdin);
    freopen ("ssnd.out","w",stdout);
    int i;

    ciur ();
    scanf ("%d",&t);
    for (i=1; i<=t; ++i)
    {
        scanf ("%lld",&n);
        solve ();
    }

    return 0;
}