#include <cstdio>
#include <math.h>
FILE *f,*g;
int nr=1;
int prim[100000];
char p [100000];
long long aux;
int i,j,sum,t,put,div,d;
long long x,y;

void ciur(int n) {
  int i, j;
  for (i = 1; ((i * i) << 1) + (i << 1) <= n; i += 1) {      
    if ((p[i >> 3] & (1 << (i & 7))) == 0) {
      for (j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1) {
        p[j >> 3] |= (1 << (j & 7));
      }
    }
  }
  prim[nr]=2;
  for (i = 1; 2 * i + 1 <= n; ++i)  
       if ((p[i >> 3] & (1 << (i & 7))) == 0) 
           prim[++nr]=2*i+1;
}

inline int cos(long long d,int p) {
int j;
long long sol=1;

for (j=1;j<=p+1;j++) 
	sol=sol*d;
sol=sol-1;
sol=sol/(d-1);
return (sol % 9973);
}



int main() {
f=fopen("ssnd.in","r");
g=fopen("ssnd.out","w");

fscanf(f,"%d",&t);
ciur(1000000);

for (i=1;i<=t;i++)  {
	fscanf(f,"%lld",&x);
	y=x;
	sum=1;  
	div=1;
	for (j=1;prim[j]<=sqrt(x) && y>1;j++) {
		if (!(y % prim[j])) {
			d=prim[j];
			put=0;
			while (!(y%d) && y>1) {
				put++;
				y/=d;
				}				
			div*=(put+1);
			sum=(sum*cos(d,put))%9973;
			}
		}
	if (y>1) {
		div*=2;
		aux=y*y-1;
		aux=aux/(y-1);
		sum=(sum*aux) % 9973;
		}
	fprintf(g,"%d %d\n",div,sum);
	}



}