#include <iostream>
#include <fstream>
#include <bitset>
#include <cmath>
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,cop,Ndiv,nr,Sdiv,tes,dp=0;
ull p[1000000],d[1000000],divp[1000000];
void Sieve()
{

    for(i=2;i<dim;i++)
        if(v[i]==0)
        {
            divp[dp++]=i;
            for(j=i*i;j<dim;j+=i)
                v[j]=0;
        }
}
void precalcul()
{
    nr=0;
    cop = n;
    for(i=0;i<=dp && divp[i]*divp[i]<=cop;i++)
        if ((n%divp[i]==0))
        {
            p[nr++] = divp[i];
            d[nr-1] = 1;
            while(cop%divp[i]==0)
            {
                cop /=divp[i];
                d[nr-1]++;
            }
        }
}
ull D()
{
    if (cop==n)
    {
        if (cop==1)
            return 1;
        else
            return 2;
    }
    Ndiv = 1;
    for(i=0;i<nr;i++)
        Ndiv *=d[i];
    return Ndiv;
}
ull put(ull base,ull k)
{
    ull b=base,res=1;
    while(k)
    {
        if(k&1)
            res = (res*base)%mod;
        base *=base;
        base %=mod;
        k>>=1;
    }
    res = (res-1)/(b-1);
    return res;
}
ull S()
{
    Sdiv = 1;
    if (nr==0)
    {
        if (n==1)
            return 1;
        else
            return n+1;
    }
    for(i=0;i<nr;i++)
        Sdiv = ((Sdiv%mod)*(put(p[i],d[i])%mod))%mod;
    return Sdiv%mod;
}
int main()
{
    in>>t;
    Sieve();
    for(tes=0;tes<t;tes++)
    {
        in>>n;
        precalcul();
        out<<D()<<" "<<S()<<endl;
    }
    return 0;
}