#include <bits/stdc++.h>
#define pb push_back

using namespace std;

class Parser {
  private:
    static const int SIZE = 1e5;
    char str[SIZE];

    int ptr;
    FILE *fin;

    char getChar() {
        if (ptr == SIZE) {
            fread(str, sizeof(char), SIZE, fin);
            ptr = 0;
        }
        return str[ptr++];
    }

    int getInt() {
        char chr = getChar();
        while (!isdigit(chr) && chr != '-')
            chr = getChar();

        int sgn = +1;
        if (chr == '-') {
            sgn = -1;
            chr = getChar();
        }

        int nr = 0;
        while (isdigit(chr)) {
            nr = nr * 10 + chr - '0';
            chr = getChar();
        }
        return nr * sgn;
    }

  public:
    Parser(const char* str) :
        ptr(SIZE), fin(fopen(str, "r")) { }

    ~Parser() {
        fclose(fin);
    }

    friend Parser& operator>>(Parser& in, int& nr) {
        nr = in.getInt();
        return in;
    }
};

ifstream fin("ssnd.in");
ofstream fout("ssnd.out");

void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"

typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;

const int DMAX = 1e6+10;
const int MOD = 9973;

vector <int> prime;

bool uz[DMAX];

ll n;
ll diviz;
int ans;

void ciur();
int explog(int x,int n);
int invmod(int x);

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t,i,j;
    int cnt;

    ciur();

    fin>>t;
    while(t--){
        fin>>n;
        diviz=ans=1;
        for(i=0;i<prime.size() && 1LL*prime[i]*prime[i] <= n;i++){
            if(n%prime[i] % 2 == 0){
                cnt=0;
                while(n%prime[i] == 0){
                    cnt++;
                    n/=prime[i];
                }
                diviz*=(cnt+1);
                ans=ans*((explog(prime[i]%MOD,cnt+1)+MOD-1)%MOD)%MOD;
                ans=(ans*invmod(prime[i]-1))%MOD;
            }
        }
        if(n > 1){
            diviz*=2;
            ans=(ans*(n+1))%MOD;
        }
        fout<<diviz<<' '<<ans<<'\n';
    }

    return 0;
}
void ciur(){
    int i,j;
    for(i=2;i*i<=(int)1e6;i++)
        if(!uz[i]){
            for(j=i*i;j<=(int)1e6;j+=i)
                uz[j]=true;
        }
    prime.pb(2);
    for(i=3;i<=(int)1e6;i++)
        if(!uz[i])
            prime.pb(i);
}
int explog(int x,int n){
    if(!n)
        return 1;
    if(n & 1)
        return 1LL*x*explog(1LL*x*x%MOD,n/2)%MOD;
    return explog(1LL*x*x%MOD,n/2);
}
int invmod(int x){
    return explog(x%MOD,MOD-2);
}