#include <fstream>
#include <iostream>
#include <cmath>

using namespace std;

const int NMAX = 999999;

int prime[NMAX], size, primes[100000], MOD = 9973, t;
long long N;

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

void getPrimes(){
	for (int i = 4; i < NMAX; i+=2)
		prime[i] = 1;
	primes[size++] = 2;
	for (int i = 3; i < NMAX; i+=2)
		if (prime[i] == 0){
			primes[size++] = i;
			for (int j = i + i ; j < NMAX; j+=i){
				prime[j] = 1;
			}
		}
}

inline pair<long long, int> divis(int p){
	pair<long long, int> result;
	int power = 0;
	long long divisor = 1;
	while (!(N % p)){
		power++;
		N /= p;
		divisor*= p;
	}
	result.first = power;
	result.second = divisor;
	return result;
}

void solve(){
	long long totalSum = 1;
	int totalDiv = 1;
	for (int i = 0; (1LL * primes[i] * primes[i] <= N) && (i < size); i++){
		if (N % primes[i] != 0) continue;
		pair<long long, int> pi = divis(primes[i]);
		totalSum*=(pi.second * primes[i] - 1) / (primes[i] - 1);
		totalDiv*=(1 + pi.first);
	}

	if (N > 1){
		totalSum*=(1+N) % MOD;
		totalDiv*=2;
	}

	g << totalDiv << " " << totalSum % MOD << "\n";
}

int main() {
	getPrimes();
	for (f >> t; t; t--){
		f >> N;
		solve();
	}

	f.close();
	g.close();
	return 0;
}