#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define l(n) (n<<1)
#define r(n) ((n<<1)+1)
#define f(n) (n>>1)
#define lsb(a) (a&-a)

#include<vector>

using namespace std;
#include<fstream>
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");

const int CIUR = 1e6+100;
const int MOD = 9973;
const int PHIMOD = 9972;
const int INF = 0x3f3f3f3f;
const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

long long n,d,s,a,t,ninitial;
int p[CIUR];

int binexp(int n, int p)
{
	int x=1;
	while(p)
	{
		if(p&1)
		{
			x=(1LL*x*n)%MOD;
			p--;
		}
		n=(1LL*n*n)%MOD;
		p/=2;
	}
	return x;
}

void ciur()
{
	int k=0;
	bool viz[CIUR];
	for(int i=2; i<=CIUR; i++)
		if(!viz[i]) // is prime
		{
			for(int j=2*i; j<=CIUR; j+=i)
				viz[j]=true;
			p[k++]=i;
		}
}

int main()
{
	cin>>t;
	ciur();
	while(t--)
	{
		cin>>n;
		ninitial=n;
		s=1;
		d=1;
		for(int i=0; p[i]*p[i]<=n; ++i)
		{
			if(n%p[i]==0)
			{
				a=0;
				while(n%p[i]==0)
				{
					a++;
					n/=p[i];		
				}
				d=(1LL*d*(a+1))%MOD;
				s=(1LL*s*(binexp(p[i], a+1)-1)*binexp(p[i]-1, PHIMOD-1))%MOD;
			}
		}
		
		if(n>1){
			s=(1LL*s*(binexp(n, 2)-1)*binexp(n-1, PHIMOD-1))%MOD;
			d=(1LL*d*2)%MOD;
		}
		cout<<d<<" "<<s<<"\n";
	}
	
	return 0;
	cout<<"THIS IS MAGIC!!!";
}