#include <iostream>
#include <vector>

using namespace std;

using ll = long long;
const ll MOD=9973;

int pow(ll x, ll p){
    int rez = 1;
    x %= MOD;
    for(; p; p >>= 1) {
        if(p & 1) {
            rez *= x;
            rez %= MOD;
        }

        x *= x;
        x %= MOD;
    }
    return rez;
}

vector<int> P;
const int maxx=1e6+5;
bool ciu[maxx];

void ciur() {
    for (int i = 2; i < maxx; ++i) {
        if (!ciu[i]) {
            P.emplace_back(i);
            for (int j = i + i; j < maxx; j += i) {
                ciu[j] = true;
            }
        }
    }
}

void solve()
{
    int N;
    cin>>N;
    int nd = 1, sd = 1;
    for (int i = 0; i < P.size() && 1LL * P[i] * P[i] <= N; ++i) {
        if (N % P[i]) continue;
        int p = 0;
        while (N % P[i] == 0) {
            N /= P[i];
            ++p;
        }
        nd *= (p + 1);
        int p1 = (pow(P[i], p + 1) - 1) % MOD;
        int p2 = pow(P[i] - 1, MOD - 2) % MOD;
        sd = (((sd * p1) % MOD) * p2) % MOD;
    }
    if (N > 1) {
        nd *= 2;
        sd = (1LL * sd * (N + 1) % MOD);
    }
    cout << nd << " " << sd << "\n";
}

int main()
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    freopen("ssnd.in", "r", stdin);
    freopen("ssnd.out", "w", stdout);

    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    P.reserve(maxx);
    ciur();
    for(int tt=1; tt<=t; tt++){
        solve();
    }
    return 0;
}