#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;
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--)
    {
        ll n,cn;
        fin>>n;
        cn=n;

        int card=1,sum=1;

        for(int j=0;primes[j]*primes[j]<=n && j<primes.size();j++)
        {
            int p=0;
            ll prod=primes[j];
            while(cn%primes[j]==0)
            {
                p++;
                prod*=primes[j];
                cn/=primes[j];
            }

            card*=(p+1);
            sum=(sum*((prod-1)/(primes[j]-1)))%mo;

            if(n%primes[j]==0 && v[n/primes[j]]==0 && n/primes[j]!=primes[j])
            {
                int p=0;
                ll prod=n/primes[j];
                while(cn%(n/primes[j])==0)
                {
                    p++;
                    prod*=(n/primes[j]);
                    cn/=(n/primes[j]);
                }

                card*=(p+1);
                sum=(sum*((prod-1)/(n/primes[j]-1)))%mo;
            }

        }
        if(card==1)
            fout<<2<<" "<<(1+n)%mo<<"\n";
        else
            fout<<card<<" "<<sum%mo<<"\n";
    }

    return 0;
}