#include<stdio.h>
#include<math.h>
#define mod 9973
using namespace std;
FILE*f=fopen("ssnd.in","r");
FILE*g=fopen("ssnd.out","w");
long long n;
int nr,v[80000],t;
char c[1000001];
struct div
{
	int e;
	long long p;
} w[50001];
int put(int x,int e)
{
	int p=1;
	while(e)
	{
		if(e%2)
			p=(p%mod)*(x%mod)%mod;
		x=(x%mod)*(x%mod)%mod;
		e/=2;
	}
	return p;
}
int main()
{
	v[++nr]=2;
	
	for(register int i=3;i<=1000000;i+=2)
		if(!c[i])
		{
			v[++nr]=i;
			for(register int j=i+i;j<=1000000;j+=i)
				c[j]=1;
		}
	fscanf(f,"%d",&t);
	
	for(register int o=1;o<=t;++o)
	{
		fscanf(f,"%lld",&n);
		int nn=sqrt(n);
		int p=1;
		int s=1;
		for(register int i=1;v[i]<=nn&&n>1;++i)
		{
			if(n%v[i]==0)
			{
				
				int X=0;
				int Y=v[i];
				while(n%v[i]==0)
				{
					X++;
					n/=v[i];
				}
				p*=(X+1);
				s=(s*(put(Y%mod,X+1)-1)%mod*put((Y-1)%mod,mod-2))%mod;
			}
		}
		if(n>1)
		{
			int X=1;
			p*=2;
			int Y=n;
			s=(s*(put(Y%mod,X+1)-1+mod)%mod*put((Y-1)%mod,mod-2))%mod;
		}
	
		fprintf(g,"%d ",p);
		fprintf(g,"%d\n",s);
		
	}
	
	
	
	fclose(g);
	fclose(f);
	return 0;
}