#include <bits/stdc++.h>

using namespace std;

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

const int NMAX = 1000005;
const int MOD = 9973;
int primes[NMAX], c;
bool ciur[NMAX / 2];
long long sum_div, nr_div, power, val, pr;

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

void divizori(long long numar)
{
    nr_div = sum_div = 1;
    for(int i = 1; i <= c && primes[i] * primes[i] * 1LL <= numar; i++)
    {
        power = 0; pr = 1;
        while(!(numar % primes[i]))
        {
            numar /= primes[i];
			power++;
			pr *= primes[i];
        }
        if (power)
		{
			nr_div *= (power + 1);
			sum_div = (sum_div * (pr * primes[i] - 1)) / (primes[i] - 1);
			sum_div %= MOD;
		}
    }

    if(numar > 1)
    {
        nr_div *= 2;
        sum_div = (sum_div * (numar + 1)) % MOD;
    }
	fout << nr_div << ' ' << sum_div << '\n';
}

int main()
{
	int nr; fin >> nr;
	init();
	for (int i = 0; i < nr; i++)
	{
		fin >> val;
		divizori(val);
	}
	return 0;
}