#include <fstream>
#include <bitset>
#define mod 9973
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int n,t,i,nrdiv,f[1000010],v[1000010],k,j;
long long sumel;
int RID(int n,int exp)
{
    int sol=1;
    while(exp>0)
    {
        if(exp%2==1) sol=(1ll*sol*n)%mod;
        n=(n*n)%mod;
        exp/=2;
    }
    return sol;
}

void dez(long long d)
{
    int nr=0;
    while(n%d==0) n/=d,nr++;
    if(nr==0) return;
    nrdiv*=nr+1;
    int val=RID(d%mod,nr+1)-1;
    if(val<0) val+=mod;
    sumel*=val*RID((d-1)%mod,mod-2);
    sumel%=mod;
}
int main()
{
    for(i=3;i*i<=1000000;i+=2)
        if(f[i]==0) for(j=i*3;j<=1000000;j+=i*2) f[j]=1;
    v[++k]=2;
    for(i=3;i<=1000000;i+=2) if(f[i]==0) v[++k]=i;
    fin>>t;
    for(;t--;)
    {
        fin>>n;sumel=1;nrdiv=1;
        for(i=1;i<=k&&v[i]*v[i]<=n;i++) if(n%v[i]==0) dez(v[i]);
        if(n!=1) dez(n);
        fout<<nrdiv<<" "<<sumel<<"\n";
    }
    return 0;
}