#include <fstream>
#include <iostream>
using namespace std;

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

long long expLog(long long a, long long b);
void construiestePrime(long long& ind, long long Prime[], bool prime[], const int N);

int main()
{
    const int Dim = 1000005;
    long long ind;
    long long Prime[Dim];
    bool prime[Dim] = {0};
    int factor;

    long long n, div, sdiv, nrdiv, exp;

    long long indd;

    construiestePrime(ind, Prime, prime, Dim);

    fin >> n;

    for(long long i = 1; i <= n; ++i)
    {
        fin >> div;

        indd = 1;
        sdiv = 1;
        nrdiv = 1;

        while(div != 1)
        {
            exp = 0;
            factor = Prime[indd];

            while(div % factor == 0)
            {
                div = div / factor;
                exp++;
            }

            nrdiv = nrdiv * (exp + 1);
            sdiv = (sdiv * (((expLog(factor, exp + 1) - 1) / (factor - 1)) % 9973)) % 9973;

            if(factor * factor> div)
                factor = div;

            indd++;
        }

        fout << nrdiv << ' ' << sdiv << '\n';
    }

    fin.close();
    fout.close();

    return 0;
}

long long expLog(long long a, long long b)
{
    if(b == 1)
        return a;

    else if(b % 2 == 0)
        return expLog(a * a, b / 2);

    return a * expLog(a * a, b / 2);
}

void construiestePrime(long long& ind, long long Prime[], bool prime[], const int N)
{
    ind = 0;
    prime[0] = prime[1] = 1;
    for(long long i = 2; i * i <= N; ++i)
        if(prime[i] == 0)
            for(long long j = i * i; j <= N; j += i)
                prime[j] = 1;

    for(long long i = 2; i <= N; ++i)
        if(prime[i] == 0)
            Prime[++ind] = i;

    /*for(long long i = 1; i <= ind; ++i)
        fout << Prime[i] << ' ';
    fout << '\n';*/
}