#include <iostream>
#include <fstream>
#include <stdio.h>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <stack>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

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

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int valMax = 1e6 + 5;
const ll inf = 1e18 + 5;
const int mod = 9973;

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

ll pw(ll base,ll exp) {
    ll ans = 1;
    while (exp) {
        if (exp & 1) {
            ans = (ans * base) % mod;
        }

        exp >>= 1;
        base = (base * base) % mod;
    }

    return ans;
}

int main() {

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

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

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

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

            ll nr = 0;
            while (N % p == 0) {
                N /= p;
                ++nr;
            }

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

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

    return 0;
}