#include <bits/stdc++.h>
#define ll long long 
#define fi first
#define se second
#define MOD 9973

using namespace std;

ifstream in("ssnd.in");
ofstream out("ssnd.out");

int t; 
ll n;

ll fast_pow(ll n, ll p) {
    ll ans = 1;
    int lim = 64 - __builtin_clzll(p);

    for (int i = 0; i <= lim; i++) {
        if (p & (1ll << i)) {
            ans = (ans * n) % MOD; 
        }

        n = (n * n) % MOD;
    }

    return ans; 
}

ll inverse(ll n) {
    return fast_pow(n, MOD - 2);
}

vector<pair<ll, ll> > decompose(ll n) {
    vector<pair<ll, ll> > ans;
    
    for (ll i = 2; i * i <= n; i++) {
        if (n % i) {
            continue;
        }

        ll count = 0;
        while (n % i == 0) {
            count++;
            n /= i;
        }

        ans.push_back({i, count});
    }

    if (n > 1) {
        ans.push_back({n, 1});
    }

    return ans;
}

void solve() {
    in >> n;

    ll div_sum = 1, div_count = 1;
    auto decomp = decompose(n);
    
    for (auto [div, div_pow] : decomp) {
        div_count = div_count * (div_pow + 1) % MOD;

        div_sum = (div_sum * (fast_pow(div, div_pow + 1) - 1)) % MOD;
        div_sum = (div_sum * inverse(div - 1)) % MOD;
    }

    out << div_count << ' ' << div_sum << '\n';
}

int main() {
    in >> t;
    while (t--) {
        solve();
    }

    return 0;
}