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

const int MOD = 9973;

int main() {
	freopen("ssnd.in", "r", stdin);
	freopen("ssnd.out", "w", stdout);

	int t;
	int n;

	scanf("%d", &t);

	while (t --) {
		scanf("%d", &n);

		long long suma = 0;
		int numarDiv = 0;

		for (int i = 1;i * i <= n;i ++) {
			if (n % i == 0) {
				suma = (suma + i) % MOD;
				suma = (suma + n / i) % MOD;
				numarDiv += 2;
			}
		}

		int SQRT = sqrt(n);

		if (sqrt(n) == SQRT) {
			numarDiv -= 1;
			suma = (suma - SQRT) % MOD;
		}

		printf("%d %d\n", numarDiv, suma);
	}

	return 0;
}