#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
#define MAX 1000100
#define MOD 9973
typedef vector <int> :: iterator iter;
vector <int> primes;
bool p[MAX];
void ciur()
{
    int n = 1000000, i, j;
    for(i = 2 ; i * i <= n ; i++)
        if(!p[i])
            for(j = i * i ; j <= n ; j += i)
                p[j] = 1;
    for(i = 2 ; i <= n ; i++)
        if(!p[i])
            primes.push_back(i);
}

int main()
{
    int i, t;
    long long y, l, c, nr_div, sum, x;
    ciur();
    fin >> t;
    while(t--)
    {
        nr_div = 1;
        sum = 1;
        fin >> x;
        for(iter it = primes.begin() ; it != primes.end() ; it++)
        {
            i = *it;
            if(i * i > x)
                break;
            if(x % i == 0)
            {
                y = 1;
                l = 1;
                c = 0;
                while(x % i == 0)
                {
                    x /= i;
                    l = (1ll * l * i) % MOD;
                    y = 1ll * y + l;
                    c++;
                }
                nr_div = (1ll * nr_div * (c + 1)) % MOD;
                sum = (1ll * sum * y) % MOD;
               // cout << i << " " << y << " " << l << " " << c << " " << x << " " << nr_div << " " << sum << "\n";
            }
        }
        if(x > 1)
        {
            sum = (1ll * sum * (x + 1)) % MOD;
            nr_div = (1ll * nr_div * 2) % MOD;
        }
        fout << nr_div << " " << sum << "\n";
    }
}