#include <bitset>
#include <cstdio>
using namespace std;


FILE* fout = fopen("ssnd.out","w");

#define MAXP 1000005
#define MOD 9973

typedef long long int64;

//<parsing>
FILE* fin = fopen("ssnd.in","r");
const unsigned maxb = 8192;
char buf[maxb];
unsigned ptr = 0;

inline int64 getInt()
{
	int64 nr = 0;
	while (buf[ptr] < '0' || '9' < buf[ptr]) {
		if (++ptr >= maxb) {
			fread (buf, maxb, 1, fin), ptr = 0;
		}
	}

	while('0' <= buf[ptr] && buf[ptr] <= '9') {
		nr = nr * 10 + buf[ptr] - '0';
		if (++ptr >= maxb) {
			fread(buf, maxb, 1, fin), ptr = 0;
		}
	}
	return nr;
}
//</parsing>


int prim[80000],np = 0;
bitset<MAXP> era;

inline int pow(int a, int p){
	int x = a % MOD, r = 1;
	while (p) {
		if (p & 1) {
			r = (r * x) % MOD;
		}

		x = (x * x) % MOD, p >>= 1;
	}
	return r;
}

void ciur()
{
	for (int i = 1; ((i * i) << 1) + (i << 1) < MAXP; ++i){
		if(!era[i]){
			for(int j = ((i * i) << 1) + (i << 1);(j << 1) + 1 < MAXP; j += (i << 1) + 1){
				era[j] = true;
			}
		}
	}
	prim[np++] = 2;
	for(int i = 1;(i << 1) + 1< MAXP;i++){
		if(!era[i]){
			prim[np++]=(i << 1) + 1;
		}
	}
}

void doTest(int64 nr)
{
	int nd = 1, sd = 1;

	for (int i = 0; i < np && (int64)prim[i] * prim[i] <= nr; ++i) {
		if (!(nr % prim[i])) {
			int p = 0;

			while (!(nr % prim[i])) {
				nr /= prim[i];
				++p;
			}

            nd = nd * (p + 1);
            sd = (((sd * ((pow(prim[i], p + 1) - 1) % MOD)) % MOD) * (pow(prim[i] - 1, MOD - 2) % MOD)) % MOD;
		}
	}

	if (nr > 1) {
		nd = nd << 1;
		sd = ((int64)sd * (nr + 1)) % MOD;
	}

	fprintf(fout,"%d %d\n", nd, sd);
}

int main(){
	ciur();

	for(int i = 0, t = getInt();i < t; i++){
		doTest(getInt());
	}

	fclose(fin);
	fclose(fout);
	return 0;
}