#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

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

#define pb push_back
typedef long long ll;
const ll NMax = 1e12 + 5;
const ll valMax = 1e6 + 5;
const int mod = 9973;

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

ll pw(ll,ll);

int main() {

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

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

    /*
    for (int i=1;i<=200;++i) {
        cout<<primes[i]<<' ';
    }
    //*/


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

        ll nrDiv = 1,sumTop = 1,sumBot = 1,p;
        for (int i=1; (p = primes[i]) != 0 && p*p <= N;++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 *= 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;
}

ll pw(ll b,ll e) {
    ll ans = 1;
    while (e) {
        if (e&1) {
            ans = (ans * b) % mod;
        }
        b = (b*b) % mod;
        e >>= 1;
    }
    return ans;
}