#include <fstream>
#include <iostream>

using namespace std;

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

const int sqrtN = 1000000,
          MOD = 9973,
          primes = 78498;

int p[primes+1], k = 1;
bool b[sqrtN+1];

void ciur(int n) {
    b[0] = b[1] = 1;
    for(int i = 4; i <= n; i += 2)
        b[i] = 1;
    for(int i = 3; i*i <= n; i++)
        if(!b[i])
            for(int j = i*i; j <= n; j += i)
                b[j] = 1;
    p[1] = 2;
    for(int i = 3; i <= n; i += 2)
        if(!b[i])
            p[++k] = i;
}

long long putere(long long x, int p) {
    long long a = 1;
    while(p > 0) {
        while(p%2 == 0) {
            x = x*x%MOD;
            p /= 2;
        }
        a = a*x % MOD;
        p--;
    }
    return a;
}

int main()
{
    ciur(sqrtN);
    int t;
    long long n;
    in >> t;
    while(t--) {
        in >> n;
        long long nrd = 1, sd = 1;
        for(int d = 1; p[d]*p[d] <= n; d++) {
            if(n%p[d] == 0) {
                int c = 0;
                while(n%p[d] == 0) {
                    n /= p[d];
                    c++;
                }
                nrd *= (c+1);
                sd = sd*(putere(p[d], c+1)-1)%MOD * putere(p[d]-1, MOD-2) % MOD;
            }
        }
        if(n > 1) {
            nrd *= 2;
            sd = sd*(putere(n, 2)-1)%MOD * putere(n-1, MOD-2)%MOD;
        }
        out << nrd << ' ' << sd << '\n';
    }
    return 0;
}