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

#define dim 1000003
#define mod 9973
bitset<dim> v;
int q[78451];

int main()
{
	long long i, j, t, n, nr, s;
	long long unsigned p, div;
	ifstream fin("ssnd.in");
	ofstream fout("ssnd.out");
	
	fin>>t;
	int f=0;
	q[0]=2;
	for(i=2;i<=1000000;++i)
	{
		++i;
		if(v[i]==0)
		{
			q[++f]=i;
			for(j=i;j<=1000000/i;++j)
			{
					v[i*j]=1;
					++j;
			}
		}
	}
	for(i=1;i<=t;++i)
	{
		fin>>n;
		j=0;
		s=div=1;
		
		while(n>1)
		{
				p=1;nr=0;
				while(n%q[j]==0)
				{
					++nr;
					p*=q[j];
					n/=q[j];
				}
				
				div*=(nr+1);
				s*=(((p*q[j])-1)/(q[j]-1))%mod;
				++j;
			}
			fout<<div <<" " <<s%mod <<'\n';
		
		
	}
			
			return 0;
}