#include <fstream>
#include <bitset>
#define R 9973
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long n,t,i,j,exp,prime[100000];
long long x,nrdiv,divizor,putere,sumdiv;
bitset <1000100> b;
int explog(long long a,long long p){
    if(p==0)return 1;
    long long r=explog(a,p/2);
    if(p%2)return (r*r*a)%R;
    return (r*r)%R;
}
int invmod(int a){
    return explog(a,R-2);
}
int main(){
     for(i=2;i<=1000000;i++)
        if(b[i]==0){
            prime[++prime[0]]=i;
            for(j=i+i;j<=1000000;j+=i)
                b[j]=1;
        }
     for(fin>>t;t--;){
        fin>>x;
        if(x==1){fout<<"1 1\n";continue;}
        nrdiv=sumdiv=1;
        for(i=1;i<=prime[0] && prime[i]<=x/prime[i] && x>1;i++){
            if(x%prime[i])continue;
            divizor=prime[i];
            exp=1;
            while(x%divizor==0){
                exp++;
                x/=divizor;
            }
            nrdiv*=exp;
            sumdiv*=((R-1+explog(divizor,exp))%R*invmod(divizor-1))%R;
        }
        if(x>1){
            nrdiv*=2;
            sumdiv=(sumdiv*(x+1))%R;
        }
        fout<<nrdiv<<" "<<sumdiv<<"\n";
    }
    return 0;
}