#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int mod = 9973;
const int nmax = 1000000;

int t, i, j, P[nmax / 10], p, F[100], E[100], M, Numar;

ll N, Suma;

bitset<nmax> viz;

void ciur()
{
    P[++p] = 2;
    for(i = 3; i * i <= nmax; i += 2)
        if(!viz[i])
        {
            P[++p] = i;
            for(j = i * i; j <= nmax; j += i)
                viz[j] = 1;
        }
    for(; i <= nmax; i += 2)
        if(!viz[i])
            P[++p] = i;
}

ll lgpow(ll a, ll b)
{
    ll r = 1;

    for(ll i = 1; i <= b; i <<= 1)
    {
        if(i & b) r = (r * a) % mod;
        a = (a * a) % mod;
    }

    return r;
}
int main()
{
    freopen("ssnd.in", "r", stdin);
    freopen("ssnd.out", "w", stdout);

    ciur();

    scanf("%d", &t);
    for(; t; t--)
    {
        scanf("%lld", &N);

        M = 0;
        memset(E, 0, sizeof(E));

        for(i = 1; i <= p && P[i] * P[i] <= N; i++)
            if(N % P[i] == 0)
            {
                F[++M] = P[i];
                while(N % P[i] == 0)
                    N /= P[i], E[M]++;
            }
        if(N > 1) F[++M] = N, E[M] = 1;

        Numar = Suma = 1;
        for(i = 1; i <= M; i++)
        {
            Numar = Numar * (E[i] + 1);
            Suma = (Suma * (lgpow(F[i], E[i] + 1) - 1 + mod) % mod * lgpow(F[i] - 1, mod - 2) % mod) % mod;
        }
        printf("%d %lld\n", Numar, Suma);
    }

    return 0;
}