#include <iostream>
#include <fstream>
#include <cmath>
#define mod 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int v[1000005],prim[80005];
void nrdiv(long long n, long long &suma, int &nr)
{
    int d=1,p=0,k;
    suma=1;
    nr=1;
    while(n>1)
    {
        p=0;
        k=(prim[d])%mod;
        while(n%prim[d]==0)
        {
            k=(1LL*k*prim[d])%mod;
            p++;
            n=n/prim[d];
        }
        if(p>0)
        {
            nr=1LL*nr*(p+1)%mod;
          k--;
         suma=(1LL*suma*(k/(prim[d]-1)))%mod;
        }
        d++;
    }
    g<<nr<<" "<<suma;


}
int main()
{
long long i,j,n,k=0,suma,x;
int nr;
v[1]=1;
for(i=2;i<=1000000;i++)
    if(v[i]==0)
    {
        k++;
        prim[k]=i;
            for(j=2*i;j<=1000000;j=j+i)
                   v[j]=1;
    }

f>>n;
for(i=1;i<=n;i++)
{
    f>>x;
nrdiv(x,suma,nr);
g<<endl;

}



    return 0;
}