#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

const int MAXP = 1e6 + 5;
bool comp[MAXP];
vector<int> primes;

pair<long long, long long> sigma_tau(long long b){
	long long sigma = 1;
	long long tau = 1;
	long long q;
	int exp;
	for(auto p : primes){
		if(p*p > b)
			break;

		exp = 0;
		q = 1;
		while(b % p == 0){
			b = b / p;
			q = q * p;
			++exp;
		}

		tau = tau * (1 + exp);
		sigma = (q*p - 1) / (p - 1);

	}
	if(b != 1){
		tau = tau * (1 + 1);
		sigma = sigma * (b + 1);
	}

	pair<long long, long long> ans = {sigma, tau};
	return ans;
}

void erathostenes(){
	int p = 2;
	while(p*p <= MAXP){
		for(int i = 2*p; i <= MAXP; i = i + p){
			comp[i] = true;
		}
		++p;
		while(comp[p])
			++p;
	}

	for(int i = 2; i <= MAXP; ++i){
		if(!comp[i])
			primes.push_back(i);
	}
}






int main(){
	ifstream fin;
	ofstream fout;
	fin.open("ssnd.in");
	fout.open("ssnd.out"); 
	long long n, a, b;

	fin >> n;
	erathostenes();
	for(int i=1; i<=n; ++i){
		fin >> a;
		fout << sigma_tau(a).second << " " << sigma_tau(a).first;
		fout << "\n";
	}

}