#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

#define MOD 9973

ifstream fin("test.in");
ofstream fout("test.out");

int k, s;
void descompunere(int x) {
    int d = 2;
    k = 1, s = 1;
    while (x != 1) {
        if (d*d > x) break;
        if (x % d == 0) {
            int p = 0;
            int prod = 1, sum = 1;
            while (x % d == 0) {
                prod *= d;
                prod %= MOD;

                sum += prod;
                if (sum > MOD) sum -= MOD;

                p++;
                x /= d;
            }


            if (p != 0) {
                k *= (p + 1);
                k %= MOD;

                s *= sum;
                s %= MOD;
            }
        }
        d++;
    }
    if (x != 1) {
        k *= 2;
        s *= x + 1;
    }
}

int main() {
    int n, x;
    fin>>n;
    for (int i = 1; i <= n; i++) {
        fin>>x;

        descompunere(x);
        fout<<k<<" "<<s<<endl;
    }

    return 0;
}