#include <fstream>
#include <cmath>
#define mod 9973
#define NMAX 1000005
#include <bitset>
#include <vector>
#define pb push_back

using namespace std;

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

bitset <NMAX> v;
vector <int> prime;
int i,nr,aux,suma,nrd,nrquiz,exponent;

void ciur()
{
    v[0]=v[1]=1;
    int i,j;

    for (i=4; i<=NMAX; i+=2) v[i]=1;
    prime.pb(2);

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

bool este_prim(int x)
{
    int st=0, dr=prime.size(), med;
    while (st<=dr)
    {
        med=(st+dr)/2;
        if (prime[med]==x) return 1;
        else
        if (prime[med]<x) st=med+1;
        else
        dr=med-1;
    }
    return 0;
}

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

int main()
{
    ciur();

    f>>nrquiz;

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