#include<fstream>  
#include<cmath>
using namespace std;  
ifstream f("ssnd.in");  
ofstream g("ssnd.out");  
char prim[2000005]; 
long long ciur(long long nr)
{long long a,b;
for(a=2;a<=sqrt(nr);a++)
	prim[a]=1;
for(a=2;a<=sqrt(nr);a++)
	if(prim[a]) 
	for(b=a*a;b<=sqrt(nr);b+=a) 
		prim[b]=0; 
}	
long long powA(long long baza, long long exponent) 
{long long k,putere; 
putere=1;  
for(k=1;k<=exponent+1;k++) 
    putere*=baza; 
return putere;  
} 
int main()  
{ long long n,nrdiv,sumadiv,j,i; int t,fm;
f>>t;   
for(j=1;j<=t;j++)  
{  
f>>n; ciur(n); nrdiv=sumadiv=1; 
if(prim[n]) {nrdiv*=2; sumadiv*=(1+n);} else 
	{i=2;  
do{fm=0;
while(n%i==0 )      
{fm++;       
n/=i;}      
nrdiv*=(fm+1);        
sumadiv*=(powA(i,fm)-1)/(i-1); 
i++;
}while(n!=1);  
}g<<nrdiv<<" "<<sumadiv%9973<<'\n';}

}