#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;
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;
        }
}

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

        card=1,sum=1;
        for(int j=0;1LL*primes[j]*primes[j]<=n && j<primes.size();j++)
            if(n%primes[j]==0)
            {
                int prim=primes[j];
                int p=0;
                ll prod=prim;
                while(n%prim==0)
                {
                    p++;
                    prod*=prim;
                    n/=prim;
                }

                card*=(p+1);
                sum=(sum*((prod-1)/(prim-1)))%mo;
            }
        if(n>1)
        {
            card*=2;
            sum*=(n+1);
        }
        fout<<card%mo<<" "<<sum%mo<<"\n";
    }

    return 0;
}