#include <bits/stdc++.h>
#define DAU  ios_base::sync_with_stdio(false); fin.tie(0); fout.tie(0);
#define PLEC fin.close(); fout.close(); return 0;
using namespace std;
const string problem("ssnd");
ifstream fin(problem + ".in");
ofstream fout(problem + ".out");
typedef long long i64;
const int N(1e6), MOD(9973);
bool ciur[N + 5];
vector<int> prime;
void Ciur() {
    prime.emplace_back(2);
    for (int i = 3; i <= N; i += 2)
        if (!ciur[i]) {
            prime.emplace_back(i);
            if (i <= N / i)
                for (int j = i * i; j <= N; j += i + i)
                    ciur[j] = 1;
        }
}
int q, ind, putere, d;
i64 x, nrd, sumd, curr;
int main() {
    DAU
    Ciur();
    fin >> q;
    while (q--) {
        fin >> x;
        ind = 0;
        nrd = sumd = 1;
        while (1LL * prime[ind] * prime[ind] <= x) {
            d = prime[ind++];
            putere = 0;
            curr = d;
            while (x % d == 0) {
                x /= d;
                curr *= d;
                ++putere;
            }
            curr = (curr - 1) / (d - 1);
            sumd = (sumd * curr) % MOD;
            nrd *= (putere + 1);
        }
        if (x != 1)
            nrd *= 2, sumd = (sumd * (x + 1) % MOD);
        fout << nrd << ' ' << sumd << '\n';
    }
    PLEC
}