#include <fstream>
using namespace std;
const int MOD = 9973;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int N=1000005, cnt=0;
char prim[1000005];
int p[1000005];
int main()
{
	long long n,t,i,j,nr,s,fact,e,f;

	for (i = 2; i <= N; ++i)
        prim[i] = 1;
    for (i = 2; i <= N; ++i)
        if (prim[i])
        {
            p[++cnt]=i;
            for (j = i+i; j <= N; j += i)
                prim[j] = 0;
        }


	fin>>t;
	for(i=1;i<=t;i++)
	{
		fin>>n;
		f=1;nr=1;s=1;
		while(n!=1)
			{ 
			e=0;fact=1;
			while(n%p[f]==0)
				{
				n=n/p[f];
				e++;
				fact=(fact*p[f])%MOD;
				}
			fact=(fact*p[f])%MOD;
			s=(s*(fact-1)/(p[f]-1))%MOD;
			f++;
			nr=(nr*(e+1))%MOD;
			}

		fout<<nr<<" "<<s<<"\n";
	}
}