#include <fstream>
#include <iostream>
using namespace std;

ifstream f("ssnd.in"); ofstream g("ssnd.out");

const int nmod=9973;
const int nmax=1000000;
const int snmax=1000;

int ciur[nmax+5]; //
int prim [80000];
long long i, j, n, m, t, q, s, nr, p, pp;

int main(){
	prim[++t]=2;
	for (i=3; i<=snmax; i+=2){
		if (ciur[i]==0){
			prim[++t]=i;
			for (j=i*i; j<=nmax; j+=2*i){
				ciur[j]=1;
			}
		}
	}
	for (i=snmax+1; i<=nmax; i+=2){
		if (ciur[i]==0)	prim[++t]=i;
	}
	
	f>>q;
	while (q--){
		f>>n;
		s=nr=m=1;
		while (n!=1){
			p=0; pp=prim[m];
			while (n%prim[m] == 0){
				p++;
				pp*=prim[m];
				n/= prim[m];
			}
			nr*=p+1;
			s*=(pp-1)/(prim[m]-1);
			s%=nmod;
			m++;
		}
		g<<nr<<" "<<s<<"\n";
	}
	
}