#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/

const ll mod = 9973;
const ll N = 1e6 + 200;
ll n, k, m, mi, ma;
vector<ll> p;
  	
void solve(){
	
	
	ifstream cin("ssnd.in");
	ofstream cout("ssnd.out");
	
	ll t;
	cin >> t;
	while(t--){
			cin >> n;
	m = 1;
	ll r = 1;
	for(int i = 0; p[i]*p[i]<=n; i++){
		ll x = p[i];
		if(n%x) continue;	
		k = 1;
		ll h = 1;
		ll g = 1;
		while(n%x == 0){
			n/=x;
			k++;
			h = (h*x)%mod;
			g = (g + h)%mod;
		}
		m *= k;
		r = (r*g)%mod;
	}
	if(n > 1){
		m += m;
		r = (r*(1 + n))%mod;
	} 
	cout << m << " " << r << "\n";
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
//	ifstream cin("ssnd.in");
//	ofstream cout("ssnd.out");
	
	bool a[N + 1];
	for(int i = 2; i<N; i++) a[i] = 0;
	for(int i = 2; i<N; i++){
		if(a[i]) continue;
		p.pb(i);
		for(int j = i; j < N; j += i) a[j] = 1;
	}
	
	int t=1;
//	cin >> t;
	while(t--) solve();
	
	return 0;
}