#include <fstream>
#include <bitset>

using namespace std;

const int NMAX = 1000005;
const int MOD = 9973;

int prime[NMAX];
bitset <NMAX> viz;

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

void ciur();

int main()
{
	long long p, t, d, sd, q, i;
	long long n; 
	ciur();
	fin>>t;
	for (; t>0; t--)
	{
		fin>>n;
		i=1;
		d=1;
		sd=1;/////
		for (i=1; prime[i]*prime[i]<=n; i++)
			if (n%prime[i]==0)
			{
				for (p=0, q=prime[i]; n%prime[i]==0; n/=prime[i], p++, q*=prime[i]);
				d*=p+1;
				sd=sd*(q-1)/(prime[i]-1)%MOD;////
			}//while i
			if (n>1)
			{
				d*=2;
				sd = (sd*(n+1) % MOD);
			}//if
		fout<<d<<" "<<sd<<"\n";
	}//for t
	return 0;
}//main

void ciur()
{
	int i, j;
	for (i=2; i<NMAX; i++)
	{
		if (viz[i]==0)
		{
			prime[++prime[0]]=i;
			for (j=i+i; j<NMAX; j+=i)
				viz[j]=1;
		}//if
	}//for i
}//ciur