#include<fstream>
#define LL long long
#define M 9973
#define NMAX 1000009 // un numar are divizori pana la jumatatea lui => n = 10^12 =>d <= 10^6
using namespace std;

LL n, d[50], p[50];
int t, k,semn[NMAX], ciur[NMAX],lng = 0;

inline void eratosthenes()
{
    for(int i = 2; i <= NMAX; i+=2) semn[i] = 1;
    ciur[0] = 2;
    lng = 1;
    for(int i = 3; i <= NMAX; i += 2)
    {
        if(!semn[i])
        {
            ciur[lng] = i;
            lng++;
            for(int j = i; j <= NMAX; j += i)semn[j] = 1;
        }
    }
}

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

    f>>t;
    eratosthenes();

    for(int r = 1; r <= t; ++r)
    {
        f>>n;
        LL nr;
        LL sum;

        nr = 1;
        sum = 1;

        if(semn[n])
        {
            for(int i = 0; ciur[i] * ciur[i] < n; ++i)
            {
                if(!(n % ciur[i]))
                {
                    nr = (nr + 2) % M;
                    sum = (sum + ciur[i] + n / ciur[i]) % M;

                }
            }
            sum = (sum + n) % M;
            nr = (nr + 1) % M;
        }
        else
        {
            sum = (1 + n) % M;
            nr = 2;
        }
        g<<nr<<' '<<sum <<'\n';
    }

    g.close();

    return 0;
}