#include <cstdio>
#define MOD 9973

using namespace std;

FILE *fin, *fout;

long long t, n, i, m, a, b;
long long p[100005], f[1000005];

long long lgput (long long a, long long b){
    if (b == 0){
        return 1;
    }
    else{
        long long r;
        r = lgput (a, b/2);
        if (b%2 == 0){
            return 1LL*r*r%MOD;
        }
        else{
            return 1LL*a*r*r%MOD;
        }
    }
}

void solve (long long n, long long &nrdiv, long long &sumadiv){
    long long i, e, x, d;
    nrdiv = sumadiv = 1;
    for (i=1; 1LL*p[i]*p[i]<=n && n!=1; i++){
        if (n%p[i] == 0){
            d = p[i];
            e = 1;
            while (n%d == 0){
                e++;
                n /= d;
            }
            nrdiv = nrdiv * e;
            x = lgput (d, e) - 1;
            if (x < 0)
                x += MOD;
            x = x * lgput ((d+MOD-1)%MOD, MOD-2)%MOD;
            sumadiv = sumadiv * x % MOD;
        }
    }
    if (n != 1){
        d = n%MOD;
        nrdiv *= 2;
        x = lgput (d, 2) - 1;
        if (x < 0)
            x += MOD;
        x = x * lgput ((d+MOD-1)%MOD, MOD-2)%MOD;
        sumadiv = sumadiv * x % MOD;
    }
}

void precalc (){
    int i, j;
    for (i=1; ((i*i)<<1)+(i<<1)<=1000000; i++){
        if (f[i] == 0){
            for (j=((i*i)<<1)+(i<<1); (j<<1)+1<=1000000; j+=(i<<1)+1){
                f[j] = 1;
            }
        }
    }
    p[1] = 2;
    m = 1;
    for (i=1; 2*i+1<=1000000; i++){
        if (f[i] == 0){
            p[++m] = 2*i+1;
        }
    }
}

int main(){
    fin = fopen  ("ssnd.in", "r");
    fout = fopen ("ssnd.out", "w");
    precalc();
    fscanf (fin, "%lld", &t);
    for (;t--;){
        fscanf (fin, "%lld", &n);
        solve(n, a, b);
        fprintf (fout, "%lld %lld\n", a, b);
    }
    return 0;
}