#include <fstream>
#include <bitset>

using namespace std;

bitset <1000002> ciur;
int prime[1000002];

int len;

void init(){
    for(int i = 2; i < 1000002; ++i){
        if(!ciur[i]){
            prime[++len] = i;
            for(int j = i + i; j < 1000002; j += i)
                ciur[j] = 1;
        }
    }
}


int main()
{
    ifstream fin ("ssnd.in");
    ofstream fout ("ssnd.out");
    int t;
    fin >> t;
    init();
    for(int numar = 1; numar <= t; ++numar){
        long long n;
        fin >> n;
        int nrdiv = 1, pos = 1, exp;
        long long sumdiv = 1LL;
        while(1LL * prime[pos] * prime[pos] <= n && pos <= len){
            long long put = 1LL;
            exp = 0;
            while(n % prime[pos] == 0){
                n /= prime[pos];
                put *= prime[pos];
                exp++;
            }
            put *= prime[pos];
            nrdiv *= (exp + 1);
            sumdiv *= ((put - 1) / (prime[pos] - 1));
            pos++;
        }
        if(n > 1){
            nrdiv <<= 1;
            sumdiv *= (n + 1);
        }
        sumdiv %= 9973;
        fout << nrdiv << ' ' << sumdiv << '\n';
    }
    return 0;
}