#include <fstream>
#include <math.h>
#define mod 9973
using namespace std;

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

int main() {
    int n, a;
    cin >> n;

    for (int i = 1; i <= n; ++i) {
        cin >> a;
        long long sum = 1;
        long long nrdiv = 1;
        int d = 2, p = 0;
        while (a > 1) {
            p = 0;
            while (a % d == 0) {
                ++p;
                a /= d;
            }
            
            nrdiv *= p+1;
            if (nrdiv > mod)
                nrdiv %= mod;
            sum *= (pow(d, p+1) - 1) / (d - 1);
            if (sum > mod)
                sum %= mod;
            ++d;
            if (a > 1 && d * d > a)
                d = a;
        }
        cout << nrdiv << ' ' << sum << '\n';
    }

    return 0;
}