#include <bits/stdc++.h>

using namespace std;

const int MOD = 9973;
const int N = 1000000;
bitset <N+5> ciur;
int len,P[N/10+5];

void sieve(){
    int i,j;
    for(i = 2;i <= N;i++){
        if(ciur[i] == 0){
            P[++len] = i;
            for(j = 2*i;j <= N;j += i){
                ciur[j] = 1;
            }
        }
    }
}

inline int lgput(int b, int e){
    int sol = 1;
    b %= MOD;
    while(e){
        if(e&1){
            sol = (sol*b)%MOD;
        }
        b = (b*b)%MOD;
        e >>= 1;
    }
    return sol;
}

int main()
{
    int t,test,nrd,sd,i,p,c,j,x;
    freopen("ssnd.in", "r", stdin);
    freopen("ssnd.out", "w", stdout);
    scanf("%d",&t);
    sieve();
    for(test = 1;test <= t;test++){
        scanf("%d",&x);
        nrd = 1;
        sd = 1;
        for(i = 1;i <= len && 1LL*P[i]*P[i] <= 0LL+x;i++){
            if(x%P[i] == 0){
                c = 1;
                while(x%P[i] == 0){
                    x /= P[i];
                    c++;
                }
                int p1,p2;
                p1 = (lgput(P[i],c)-1)%MOD;
                p2 = lgput(P[i]-1,MOD-2)%MOD;
                nrd = nrd*c;
                sd = (((sd*p1)%MOD)*p2)%MOD;
            }
        }
        if(x > 1){
            nrd = nrd*2;
            sd = (1LL*sd*(x+1))%MOD;
        }
        printf("%d %d\n",nrd,sd);
    }
    return 0;
}