#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <limits.h>

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

const int NMax = 1e7 + 5;
const int valMax = 1e6 + 5;
const int mod = 9973;

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

void ciur();
long long pw(long long,long long);

int main() {

    ciur();

    in>>T;
    while (T--) {
        long long N;
        in>>N;

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

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

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

void ciur() {

    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;
        }
    }
}

long long pw(long long b,long long e) {
    long long res = 1;
    while (e>0) {
        if (e % 2 == 1) {
            res = (res*b) % mod;
        }
        b = (b*b) % mod;
        e >>= 1;
    }
    return res;
}