#include <iostream>
#include <fstream>
#include <bitset>
#include <vector>
#define MOD 9973
#define MAXN 1000001

using namespace std;

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

typedef long long ll;
ll divizori,suma,cnt;
bitset<MAXN>prim;
vector<int>el;

void ciur(){
    for(ll i = 2; i < MAXN; i++){
        if(!prim[i]){
            el.push_back(i);
            for(ll j = i + i; j < MAXN; j += i)
                prim[j] = true;
        }
    }
}

void rez(ll n){

    divizori = 1,suma = 1;

    for(auto d : el){
        if(1LL*d*d > n)
            break;
        ll exp = 0,put = 1;
        while(n % d == 0){
            n /= d;
            put *= d;
            exp++;
        }

        divizori *= (exp + 1);
        suma = (put * d - 1)/(d - 1);

    }
    if(n > 1){
        divizori *= 2;
        suma *= (n + 1);
    }
}


int main()
{
    ciur();
    ll t;
    in>>t;

    for(ll i = 0; i < t; i++){
        ll nr;
        in>>nr;
        rez(nr);
        out<<divizori<<" "<<suma % MOD<<"\n";
    }
    return 0;
}