#include <bits/stdc++.h>
#define pb push_back

using namespace std;

const int m = 9973;
const int NMAX = 1000000;
bitset <NMAX+5> ciur;

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

void sieve(){
    int i,j;
    for(i = 2;i <= NMAX;i++){
        if(!ciur[i]){
            for(j = 2*i;j <= NMAX;j += i){
                ciur[j] = 1;
            }
        }
    }
}

int main()
{
    int t,test,d,c;
    long long sum,nr,n;
    freopen("ssnd.in", "r", stdin);
    freopen("ssnd.out", "w", stdout);
    scanf("%d",&t);
    sieve();
    for(test = 1;test <= t;test++){
        scanf("%lld",&n);
        if(n < NMAX){
            if(ciur[n] == 0){
                printf("%d %d\n",2,n+1);
                continue;
            }
        }
        nr = 1;
        sum = 1;
        if(n%2 == 0){
            c = 0;
            while(n%2 == 0){
                n >>= 1;
                c++;
            }
            nr *= (c+1);
            sum = (sum%m*(lgput(2,c+1)-1)%m)%m;
        }
        for(d = 3;1LL*d*d <= n;d += 2){
            if(n%d == 0){
                c = 0;
                while(n%d == 0){
                    c++;
                    n /= d;
                }
                nr *= (c+1);
                sum = (sum%m*(lgput(d,c+1)-1)%m)%m;
                sum = (sum%m*(lgput(d-1,m-2))%m)%m;
            }
        }
        if(n > 1){
            nr *= 2;
            sum = (sum%m*(n+1)%m)%m;
        }
        printf("%lld %lld\n",nr,sum);
    }
    return 0;
}