#include <fstream>

#define MOD 9973
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int P[80000];
bool prim[1000001];
int main()
{
    int t,i,j,nr=0;
    long long n,s,d,x;
    prim[1] = 1;
    for(i=2;i<=1000000;i++)
    {
        if(!prim[i])
        {
            P[++P[0]] = i;
            for(j=i+i;j<=1000000;j+=i)
                prim[j] = 1;
        }
    }
    fin>>t;
    while(t--)
    {
        fin>>n;
        nr = 1;
        s = 1;
        for(i=1;i<=P[0]&&n!=1;i++)
        {
            d=0;x = P[i];
            while(n!=1 && n%P[i]==0)
            {
                d++;
                n/=P[i];
                x*=P[i];
            }
            nr*=(d+1);
            s = (s*(x-1)/(P[i]-1))%MOD;
        }
        fout<<nr<<' '<<s<<'\n';
    }
    return 0;
}