#include <fstream>
#include <cmath>
#define ll long long
#define mod 9973
#define NMAX 1000050
#include <bitset>

using namespace std;

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

ll prime[NMAX], i, j, nrquiz, nr, suma, nrd, exponent, cont=0, aux, x0, y2;
bitset <NMAX> v;

void ciur()
{
    v[0]=v[1]=1;
    prime[++cont]=2;
    for (int i=4; i<=NMAX; i+=2)
    v[i]=1;

    for (int i=3; i<=NMAX; i+=2)
    if (v[i]==0)
    {
        prime[++cont]=i;
        for (int j=i*2; j<=NMAX; j+=i)
        v[j]=1;
    }
}

long long putere(ll x, ll y)
{
    if (x==0) return 0;
    if (x==1) return 1;
    if (y==0) return 1;
    if (y%2==1) return x*putere(x,y-1)%mod;
    if (y%2==0) return putere(x*x,y/2)%mod;
}

ll euclid(ll a, ll b, ll &x, ll &y)
{
    if (b==0)
    {
        x=1;
        y=0;
        return a;
    }
    else
    {
        ll x0, y0,d;
        d=euclid(b,a%b,x0,y0);
        x=y0;
        y=x0-(a/b)*y0;
        return d;
    }
}

int main()
{
    ciur();
    f>>nrquiz;
    while (nrquiz)
    {
        f>>nr;
        aux=nr;
        nrquiz--;
        suma=1;
        nrd=1;
        i=1;
        while (prime[i]*prime[i]<=nr)
        {
            exponent=0;
            while (aux%prime[i]==0)
            {
                exponent++;
                aux/=prime[i];
            }
            if (exponent)
            {
                nrd*=(exponent+1);
                euclid(prime[i]-1,mod,x0,y2);
                while (x0<0)
                x0+=mod;
               // g<<x0<<'\n';
                suma*=(putere(prime[i],exponent+1)-1);
                suma%=mod;
                suma*=x0;
                suma%=mod;
              //  g<<"a"<<suma<<'\n';
            }
            i++;
        }
        if (aux>1)
        {
            nrd*=2;
            suma*=(aux+1);
            suma%=mod;
        }
        g<<nrd<<" "<<suma<<'\n';
     // g<<'\n';
    }
    return 0;
}