#include <bits/stdc++.h>

using namespace std;

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

int t,i,j,n,m,prim[100000];
bool ciur[1000001];

int main()
{
    for (i=3;i<=1000;i+=2)
        for (j=i*i;j<=1000000;j+=i)
        {
            ciur[j]=1;
        }
    prim[1]=2;
    int poz=1;
    for (i=3;i<=1000000;i+=2)
        if (!ciur[i])
        {
            poz++;
            prim[poz]=i;
        }
    fin>>t;
    int x;
    for (i=1;i<=t;i++)
    {
        fin>>x;
        int n=1,s=1,d=1,p=0,j=1,rad=sqrt(x);
        while (j<=poz && x>1 && prim[j]<=rad)
        {
            p=0; n=1;
            while (x%prim[j]==0)
            {
                x/=prim[j];
                p++;
                n=n*prim[j]%9973;
            }
            d*=p+1;
            s=(s*(n*prim[j]-1)/(prim[j]-1))%9973;
            j++;
        }
        if (x>1)
            {d*=2; s=(s*(x*x-1)/(x-1))%9973;}
        fout<<d<<" "<<s%9873<<"\n";
    }
    return 0;
}