#include <iostream>
#include <fstream>
#include <algorithm>

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

#define ll long long
const int valMax = 1e6 + 5;
#define mod 9973

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

ll pw(ll,ll);

int main() {
    in>>T;

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

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

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

    while (T--) {
        ll N;
        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) + mod - 1)) % mod;
            sumBot = (sumBot * (p - 1)) % mod;
        }
        if (N != 1) {
            nrDiv *= 2;
            sumTop = (sumTop * (N + 1)) % mod;
        }

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

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

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

    return ans;
}