#include <iostream>
#include <math.h>
#include <fstream>
#define mod 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bool a[1000001]={0};
long long putere(long long c, long long d)
{
   if(d == 0) return 1;
   long long x = putere(c, d / 2);
   if(d % 2 == 0) return (x * x);
   else return ((x * x) * c);
}
void nr_prime()
{
    for(long long i=2;i<=1000000;i++)
    {
        if(a[i]==0)
            for(long long j=i;j<=1000000;j+=i)
                a[j]=0;
    }
}
void descompunere(long long n)
{
    int nd=1;
    int sd=1;
        for(long long i=2;i<=1000000&&sqrt(n)>1;i++)
        {
            if(a[i]==0)
            {
                long long p=0;
                while(n%i==0)
                {
                    p++;
                    n=n/i;
                }
                if(p>0)
                {
                    nd=nd*(p+1);
                    sd=sd*(putere(i,p+1)-1)/(i-1)% mod;
                }

            }
        }
    g<<nd<<" "<<sd;
    g<<endl;

}
int main()
{
    nr_prime();
    int t;
    long long n;
    f>>t;
    for(int j=0;j<t;j++)
    {
        f>>n;
        descompunere(n);

    }
    return 0;
}