#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
#define dim 1000001
#define mod 9973
#define ull unsigned long long int
bitset<dim> v;
ull n,i,j,t,Ndiv,Sdiv,tes,dp=0,p,d;
ull divp[1000001];
void Sieve()
{

    for(i=2;i<dim;i++)
        if(v[i]==0)
        {
            divp[dp++]=i;
            for(j=i*i;j<dim;j+=2*i)
                v[j]=1;
        }
}

void calcul()
{
    Sdiv = Ndiv = 1;
    for(i=0;i<dp && divp[i]*divp[i]<=n;i++)
        if ((n%divp[i]==0))
        {
            d = 1;
            p = divp[i];
            while(n%divp[i]==0)
            {
                n /=divp[i];
                d++;
                p *=divp[i];
            }
            Ndiv *=d;
            Sdiv *=(p-1)/(divp[i]-1)%mod;
        }
    if(n>1)
    {
        Sdiv *= (n*n-1)/(n-1)%mod;
        Ndiv *=2;
    }
}
int main()
{
    in>>t;
    Sieve();
    for(tes=0;tes<t;tes++)
    {
        in>>n;
        calcul();
        out<<Ndiv<<" "<<Sdiv%mod<<endl;
    }
    return 0;
}