#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;


int t,n,upp=1e6;
bitset<1000005>viz;
vector<int>divi;

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;
}

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");
    for(int i=2;i<=upp;i++){
        if(viz[i]==0){
            divi.push_back(i);
            for(int j=2*i;j<=upp;j+=i) viz[j]=1;
        }
    }
    cin >> t;
    while(t--){
        cin >> n;
        int nrdiv=1LL,sum=1LL;
        for(auto i:divi){
            if(i*i>n) break;
            int cnt=0;
            while(n%i==0){
                cnt++;
                n/=i;
            }
            nrdiv*=(cnt+1LL);
            nrdiv=(nrdiv)%m;
           if(cnt){ int x=(lgp(i,cnt+1LL)-1LL);
            if(x<0LL) x+=m;
            sum=(sum*x)%m;
            x=lgp(i-1LL,m-2LL);
            sum=(sum*x)%m; }
        }
        if(n>=2LL) nrdiv=(nrdiv*2LL)%m;
        if(n>=2){
            int x=(lgp(n,2LL)-1LL);
            if(x<0LL) x+=m;
            sum=(sum*x)%m;
            x=lgp(n-1LL,m-2LL);
            sum=(sum*x)%m;
        }
        cout << nrdiv << ' ' << sum << '\n';
    }
}