#include <iostream>
#include <fstream>

using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");

const int mod = 9973;
const int valMax = 1e6 + 10;

int T,nrPrimes;
int primes[valMax];
bool notPrime[valMax];

void ciur();
int pw(int,int);

int main() {
    in>>T;

    ciur();

    while (T--) {
        long long N;
        in>>N;

        int nrDiv = 1,sumTop = 1,sumBot = 1;
        int p;
        for (int i=1;(p = primes[i]) * p <= N && p!=0;++i) {
            if (N % p != 0) {
                continue;
            }
            int d = 0;
            while (N % p == 0) {
                ++d;
                N /= p;
            }

            nrDiv *= d+1;
            sumTop = sumTop * (pw(p,d+1) - 1 + mod) % mod;
            sumBot = sumBot * (p - 1) % mod;
        }
        if (N != 1) {
            nrDiv = nrDiv * 2;
            sumTop = sumTop * (pw(N,2) - 1 + mod) % mod;
            sumBot = sumBot * (N - 1) % mod;
        }

        out<<nrDiv<<' '<<sumTop * pw(sumBot,mod-2) % mod<<'\n';
    }

    in.close();out.close();
    return 0;
}

void ciur() {

    notPrime[2] = false;
    primes[++nrPrimes] = 2;
    for (int i=3;i<=valMax;i+=2) {
        if (notPrime[i]) {
            continue;
        }

        primes[++nrPrimes] = i;
        for (int j=2*i;j<=valMax;j+=2*i) {
            notPrime[j] = true;
        }
    }

}

int pw(int b,int e) {
    int res = 1;
    while (e) {
        if ((e & 1) == 1) {
            res = (1LL * res * b) % mod;
        }
        b = (1LL*b*b) % mod;
        e >>= 1;
    }
    return res;
}