#include<cstdio>
#include<cmath>
#define MOD 9973
bool b[1000010]; 

void ciur(int n){
     for(int i=2;i<=n;++i)
       if(!b[i])
         for(int j=2;j<=n/i;++j)
           b[i*j]=1;             
     }

int main(void){
    FILE *fin = fopen("ssnd.in","r");
    FILE *fout = fopen("ssnd.out","w");
    int i,t,sumdiv,nrdiv,d,p,k; long long n=0; 
    fscanf(fin,"%d",&t); 
    ciur(1000000);
    while(t--){
        fscanf(fin,"%llu",&n);      
        nrdiv=1; sumdiv=1; i=2; k=int(sqrt(n));   
        while(n!=1){
                if(!b[i] && n%i==0){    
                    d=0; p=1; 
                    while(n%i==0 && n!=1){ ++d; n/=i; p=((p%MOD)*(i%MOD))%MOD; }
                    nrdiv*=(d+1);
                    p=((p%MOD)*(i%MOD))%MOD; p-=1; sumdiv=((sumdiv%MOD)*((p/(i-1))%MOD)%MOD);
                    ++i;
                    }
                else  ++i;                         
                }
        fprintf(fout,"%d %d\n",nrdiv,sumdiv);      
      }    
 return 0;   
}