#include <iostream>
#include <fstream>
#include <vector>
#define pmax 1000000
#define ll long long
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

const int mo=9973;

int t,card,sum;
ll n,cn;
vector <int> primes;
bool v[pmax+5];

void ciur()
{
    v[0]=v[1]=1;
    for(int i=2;i<=pmax;i++)
        if(v[i]==0)
        {
            primes.push_back(i);
            for(int j=2;i*j<=pmax;j++)
                v[i*j]=1;
        }
}

void calculate(int prim)
{
    int p=0;
    ll prod=prim;
    while(cn%prim==0)
    {
        p++;
        prod*=prim;
        cn/=prim;
    }

    card*=(p+1);
    sum=(sum*((prod-1)/(prim-1)))%mo;
}

int main()
{
    fin>>t;
    ciur();
    while(t--)
    {
        fin>>n;
        cn=n;

        card=1,sum=1;

        int j=0;
        while(primes[j]*primes[j]<=n)
        {
            if(cn%primes[j]==0)
            {
                calculate(primes[j]);
                if(cn%primes[j]==0 && cn/primes[j]!=primes[j])
                    if(v[cn/primes[j]]==0)
                        calculate(cn/primes[j]);
            }
            j++;
        }
        fout<<card<<" "<<sum%mo<<"\n";
    }

    return 0;
}