#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define ll long long
#define inf (1<<30)
#define base 256
#define ba 255
#define N 1000
#define EPS 1e-12
#define mod 9973
#define inu "ssnd.in"
#define outu "ssnd.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int n,x,t,S[N],P[N];
int e[350100];
long long put,nb,et,sol;
bitset<1000100> viz;
int main ()
{
	FOR(i,2,1000000)
	if(!viz[i])
	{
		e[++et]=i;
		for(int j=i+i;j<=1000000;j+=i)
		viz[j]=1;
	}
	f>>n;
	FOR(i,1,n)
	{
		f>>x;
		t=0;
		for(int j=1;1LL*e[j]*e[j]<=x;++j)
		if(x%e[j]==0)
		{
			
			S[++t]=e[j];
			P[t]=0;
			while(x%e[j]==0)
			{
				P[t]++;
				x/=e[j];
			}
		}
		if(x!=1)
		{
			P[++t]=1;
			S[t]=x;
		}
		nb=1;
		FOR(j,1,t)
		nb*=(P[j]+1);
		g<<nb<<" ";
		sol=1;
		FOR(j,1,t)
		{
			put=S[j];
			FOR(k,1,P[j])
			put=put*S[j];
			put--;
			put/=(S[j]-1);
			put%=mod;
			sol=sol*put%mod;
		}
		g<<sol<<"\n";
	}
    return 0;
}