#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

ifstream f("ssnd.in");
ofstream g("ssnd.out");

#define mod 9973;

int t;

void fct(int n,int &nr,int &s)
{
    nr=1,s=1;
    int p=0;
    while(n%2==0)
        n/=2,++p;
    if(p)
    {
        nr*=p+1;
        s=pow(2,p+1)-1;
    }
    for(int d=3; d*d<=n; d+=2)
        {
            p=0;
            while(n%d==0)
                n/=d,++p;
            if(p)
            {
                nr*=p+1;
                s=(s*(pow(d,p+1)-1))/(d-1);
                s%=mod;
            }
        }
    if(n!=1)
        {
            nr*=2;
            s=(s*(n+1))%mod;
        }
}
int main()
{
    int n,s1,s2;
    f>>t;
    while(t)
    {
        f>>n;
        fct(n,s1,s2);
        g<<s1<<' '<<s2<<endl;
        --t;
    }
    return 0;
}