#include <bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("ssnd.in" , "r" , stdin) , freopen("ssnd.out" , "w" , stdout)
#define ll long long

using namespace std;

const int N = 1e6;
const int M = 9973;

int x;
bitset < N / 2 + 10> ciur;
vector < int > pr;

int Pw(int n , int p)
{
    int ans = 1;

    for( ; p ; p >>= 1 , n = n * n % M)
        if(p & 1)
            ans = ans * n % M;

    return ans;
}

void prec()
{
    int i , j;

    for(i = 1 ; ((i * i) << 1) + (i << 1) <= N ; i++)
        if(!ciur[i])
            for(j = ((i * i) << 1) + (i << 1) ; (j << 1) + 1 <= N ; j += (i << 1) + 1)
                ciur[j] = 1;

    pr.push_back(2);

    for(i = 1 ; (i << 1) + 1 <= N ; i++)
        if(ciur[i] == 0)
            pr.push_back(i * 2 + 1);
}

pair < int , int > solve(ll x)
{
    int e , pw , i;
    int card = 1;
    int sum = 1;

    for(i = 0 ; i < pr.size() && pr[i] <= x ; i++)
        if(x % pr[i] == 0)
        {
           e = 0;
           pw = 1;

            while(x % pr[i] == 0)
                ++e , pw = pr[i] * pw % M , x /= pr[i];

            card *= e + 1;
            sum = sum * (pw * pr[i] - 1) % M * Pw((pr[i] - 1) , M - 2) % M;
        }

    if(x > 1)
        card *= 2 , sum = sum * (x * x - 1) % M * Pw((x - 1) , M - 2) % M;

    return {card , sum};
}

signed main()
{
	#ifndef ONLINE_JUDGE
		FastIO , FILES;
	#endif

    prec();

    int q; cin >> q;
    while(q--)
    {
        cin >> x;
        pair < int , int > s = solve(x);
        cout << s.first << ' ' << s.second << '\n';
    }

    return 0;
}