#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modu=1999999973;
const int modul=998244353;

const int m=9973;

const int nmax=1000005;

int t,n;
vector<int>divi;
bitset<nmax>viz;

int lgp(int a,int b){
    int res=1LL,pop=a;
    for(int i=0;(1<<i)<=b;i++){
        if(b&(1<<i)) res=(res*pop)%m;
        pop=(pop*pop)%m;
    }
    return res;
}

void ciur(){
    for(int i=2;i<nmax;i++){
        if(viz[i]==0){
            divi.push_back(i);
            for(int j=i+i;j<nmax;j+=i) viz[j]=1;
        }
    }
    return;
}

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("ssnd.in");
    ofstream cout("ssnd.out");
    ciur();
    cin >> t;
    while(t--){
        cin >> n;
        int nrdiv=1LL,sum=1LL;
        for(auto i:divi){
            if(i*i>n) break;
            if(n%i==0){
                int cnt=0;
                while(n%i==0){
                    n/=i;
                    cnt++;
                }
                nrdiv=(nrdiv*(cnt+1LL))%m;
                int x=(lgp(i,cnt+1)-1)%m;
                if(x<0) x+=m;
                int y=(lgp(i-1,m-2));
                sum=(((sum*x)%m)*y)%m;
            }
        }
        if(n>1){
            nrdiv=(nrdiv*2)%m;
            sum=(1LL*sum*(n+1))%m;
        }
        cout << nrdiv << ' ' << sum << '\n';
    }
}