#include <stdio.h>

using namespace std;

const int MOD = 9973;

void calcNdivSdiv(long long n, int* nndiv, long long* ssdiv) {
  int ndiv = 1;
  long long sdiv = 1;
  int div = 2;
  int nr;
  while ((long long) div * div <= n) {
    nr = 0;
    long divPowNr = 1;
    while (n%div == 0) {
      ++nr;
      divPowNr *= div;
      n /= div;
    }
    ndiv *= (nr + 1);
    sdiv *= (divPowNr*div - 1) / (div-1);
    div++;
  }
  if (n != 1) {
    ndiv *= 2;
    sdiv *= (n+1);
  }
  *nndiv = ndiv;
  *ssdiv = sdiv;
}

int main() {
  freopen("ssnd.in", "r", stdin);
  freopen("ssnd.out", "w", stdout);
  int nrt;
  scanf("%d", &nrt);
  while (nrt--) {
    long long n;
    scanf("%lld", &n);
    long long sdiv;
    int ndiv;
    calcNdivSdiv(n, &ndiv, &sdiv);
    printf("%d ", ndiv % MOD);
    printf("%d\n", sdiv % MOD);
  }
  return 0;
}