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

typedef unsigned long long uint64;

const unsigned int MOD = 9973;

template<unsigned long numbits>
struct PrimeSieve
{
	long long num;
	bitset<numbits> bits;

	void GeneratePrimes(const long long n)
	{
		num=1;
		for(int i=1; ((i<<1)+1)*((i<<1)+1)<n; ++i)
		{
			if(!bits[i])
			{
				for(long long j=i; ((i<<1)+1)*((j<<1)+1)<n; ++j)
				{
					const long long index=((i<<1)+1)*((j<<1)+1);
					bits[index>>1]=1;
				}
			}
		}
	}
	
	const bitset<numbits>& GetPrimes() const
	{
		return bits;
	}
};

uint64 powl(uint64 n, int p)
{
	uint64 rez=1;
	while(p)
	{
		if(p&1)
		{
			rez*=n;
			rez%=MOD;
		}
		n*=n;
		n%=MOD;
		p>>=1;
	}
	return rez;
}

void Decompose(uint64& n, uint64 div, uint64& p, uint64& d)
{
	d=p=0;
	if(n % div == 0)
	{
		p=div;
		while(n % div == 0)
		{
			d++;
			n/=div;
		}
	}
}

int main()
{
	int t;
	uint64 n,p,d;
	fstream fin("ssnd.in", fstream::in);
	fstream fout("ssnd.out", fstream::out);
	vector<unsigned long> v;
	vector< pair<unsigned long, uint64> > factors;
	
	PrimeSieve<1000007> primes;
	primes.GeneratePrimes(1000005);
	v.push_back(2);
	for(int i=1; i<1000005; ++i)
	{
		if(!(primes.GetPrimes())[i])
		{
			v.push_back((i<<1)+1);
		}
	}
	
	fin>>t;
	//cout<<t<<endl;
	
	for(int l=0; l<t; ++l)
	{
		fin>>n;
		//n=50000000;
		uint64 i=0;
		uint64 s=1,numdiv=1;
		while(n>1 && v[i]*v[i]<=n)
		{
			Decompose(n, v[i], p, d);
			if(p)
			{
				//cout<<p<<" - "<<d<<endl;
				numdiv*=(d+1);
				//cout<<powl(p,d)<<endl<<endl;
				s=(s*((powl(p,d+1)-1)/(p-1)))%MOD;
				factors.push_back(make_pair(p,d));
			}
			i++;
		}
		if(n>1)
		{
			//cout<<n<<" -- "<<1<<endl;
			s=(s*(n+1))%MOD;
			factors.push_back(make_pair(n,1));
			numdiv*=2;
		}

		/*for(i=0; i<factors.size(); ++i)
		{
			cout<<factors[i].first<<" --- "<<3*factors[i].second<<endl;
			sum=((sum*((powl(factors[i].first,3*factors[i].second+1)-1)/(factors[i].first-1)))%MOD);
		}*/
		//cout<<sum<<endl;
		fout<<numdiv<<" "<<s<<"\n";
	}
	
	fin.close();
	fout.close();
	return 0;
}