/***
author: Morariu Tudor
*/


#include <algorithm>
#include <bitset>
#include <cstdio> 
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits.h>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector> 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")


using namespace std;
 
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl '\n'
 
void debug(vector<int> v)
{
    for(int i = 0;i < (int)v.size();i++) {cout << v[i] << ' ';}
    cout << endl;
}
void debug(vector<long long int> v)
{
    for(int i = 0;i < (int)v.size();i++) {cout << v[i] << ' ';}
    cout << endl;
}
void debug(vector<string> v)
{
    for(int i = 0;i < (int)v.size();i++) {cout << v[i] << ' ';}
    cout << endl;
}

int firstDigit(int n)
{
    while (n >= 10) n /= 10;
    return n;
}

string decToBase(int decimal, int sz, int b)
{
    string ans;
    while(decimal)
    {
        ans.push_back(decimal % b + '0');
        decimal /= b;
    }
    reverse(ans.begin(), ans.end());
    while((int)ans.size() < sz) ans.insert(ans.begin(), '0');

    return ans;
}

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

bool c[1000001];
vector<int> prms;

void sive()
{
    c[0] = 1;
    c[1] = 1;

    for(int i = 2;i < 1001;i++)
    {
        if(c[i] == 0)
        {
            for(int j = 2;j <= 1000001 / i;j++)
            {
                c[i * j] = 1;
            }
        }
    }

    for(int i = 0;i <= 1000000;i++)
    {
        if(c[i] == 0) prms.push_back(i);
    }
}

int main()
{
    sive();
    int t; fin >> t;
    //prms.insert(prms.begin(), 1);
    while(t--)
    {
        long long int n; fin >> n;
        long long int nn = n;

        long long int smd, nrd;
        long long int sq = sqrt(nn) + 1;
        smd = 1;
        nrd = 1;


        for(int i = 0;prms[i] <= sq;i++)
        {
            int e = 0;
            //cout << "prms: " << prms[i] << " n: " << n << endl;
            while(n % prms[i] == 0)
            {
                n /= prms[i];
                e++;
              //  cout << "se div la: " << prms[i] << endl;
            }
            smd *= ((long long)pow(prms[i], e + 1) - 1) / (prms[i] - 1);
            smd %= 9973;
            nrd *= (e + 1);
        }

        if(n > 1)
        {
            //prim
            nrd *= 2;
            smd *= ((long long)(n * n) - 1) / (n - 1);
            smd %= 9973;
        }


        fout << nrd  << " " << smd  << endl; //1
    }
	return 0;
}