#include <cstdio>
#define ll long long
#define mod 9973
#define Nmx 1000000
using namespace std;
ll n,j,i,sum,prod,x,cx,t;
bool ok[1000005];
int prime[100005];
int pow(int a,int x)
{
    ll p=1,i;
    for (i=1;i<=x;i++) p*=a;
    return p;
}
int calcul(int a,int x)
{
    return ((pow(a,x)-1)/(a-1));
}
int main()
{
    freopen("ssnd.in","r",stdin);
    freopen("ssnd.out","w",stdout);
    scanf("%lld",&n);
    for (i=2;i<=Nmx;i++)
       if (!ok[i])
         {
             prime[++prime[0]]=i;
             for (j=2*i;j<=Nmx;j+=i) ok[j]=true;
         }
    for (i=1;i<=n;i++)
    {
        scanf("%lld",&x);
        prod=1;sum=1;cx=x;j=1;
        while (cx>0 && cx>=prime[j]*prime[j])
        {
            t=0;
            while (cx%prime[j]==0) cx=cx/prime[j],t++;
            if (t>0) sum=sum*calcul(prime[j],t+1),prod=prod*(t+1);
            j++;
        }
        if (cx>1) prod*=2,sum=sum*(cx*cx-1)/(cx-1);
        printf("%lld %lld\n",prod,sum%mod);
    }
    return 0;
}