#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();

inline int pow(int x, int p) {/////////////////
	int rez = 1;
	x %= MOD;

	for(; p; p >>= 1) {
		if(p & 1) {
			rez *= x;
			rez %= MOD;
		}

		x *= x;
		x %= MOD;
	}

	return rez;
}

int main()
{
	int p, t, d, sd, p1, p2, 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)
			{
				p=0;
				while ((n%prime[i])==0)
				{
					n/=prime[i];
					p++;
				}//while
				d*=p+1;
				p1 = (pow(prime[i], p+1) - 1) % MOD;////
				p2 = pow(prime[i]-1, MOD-2) % MOD;///
				sd = (((sd * p1) % MOD) * p2) % 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