#include <bits/stdc++.h>

using namespace std;

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

const int MOD = 9973;
const int LIM = 1e6;
bitset <LIM> ciur;
vector <int> p;

void mark(int prim){
    for(int i=prim*prim; i<=LIM; i+=prim)
        ciur[i] = true;
}

long long n, dcnt, dsum, expo;

long long lgput(long long a, long long b){
    long long answer = 1;
    while(b != 0){
        if(b&1)
            answer *= a;
        a *= a;
        b >>= 1;
    }
    return answer;
}

signed main (){
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr);

    ciur[0] = ciur[1] = true;
    mark(2);
    mark(3);
    for(int i=5; i<=LIM/i; i+=6){
        if(!ciur[i]) mark(i);
        if(!ciur[i+2]) mark(i+2);
    }
    p.push_back(2);
    for(int i=3; i<=LIM; i+=2)
        if(!ciur[i])
            p.push_back(i);

    int teste;
    fin>>teste;
    while(teste--){
        fin>>n;
        dcnt = dsum = 1;

        for(auto prim : p){
            if(prim > n / prim) break;
            if(n % prim) continue;

            expo = 0;
            while(n % prim == 0){
                expo++;
                n /= prim;
            }

            dcnt *= (expo+1);
            dsum = (long long)dsum * ((lgput(prim, expo+1) - 1) / (prim - 1)) % MOD;
        }
        if(n > 1){
            dcnt *= 2;
            dsum = (long long)dsum * ((n*n-1) / (n-1)) % MOD;
        }
        fout<<dcnt<<" "<<dsum<<"\n";
    }
    return 0;
}