# include <cstdio>

typedef long long ll ;
const char FIN[] = "ssnd.in", FOU[] = "ssnd.out" ;
const int MAX = 1000005, MOD = 9973 ;

ll N ;
int P[MAX] ;
int T, K = 0;
unsigned char V[1 << 17];

void prec ( void ) {
    P[++K] = 2;

    for (int i = 1; ( i * i << 1 ) + ( i << 1 ) <= MAX; ++i) {
        if ( ( V[i >> 3] & ( 1 << ( i & 7 ) ) ) ) {
            continue;
        }
        for (int j = ( i * i << 1 ) + ( i << 1 ); ( j << 1 ) + 1 <= MAX; j += ( i << 1 ) + 1) {
            V[j >> 3] |= ( 1 << ( j & 7 ) );
        }

    }

    for (int i = 1; ( i << 1 ) + 1 <= MAX; ++i) {
        if ( ( V[i >> 3] & ( 1 << ( i & 7 ) ) ) == 0 ) {
            P[++K] = ( i << 1 ) + 1 ;
        }
    }
}
inline int pow(int x, int p) {
	int rez = 1;
	x %= MOD;

	for(; p; p >>= 1) {
		if(p & 1) {
			rez *= x;
			rez %= MOD;
		}

		x *= x;
		x %= MOD;
	}

	return rez;
}
inline int pow1 ( int N, int P ) {
    int sol = 1;

    for ( int i = 0; 1 << i <= P; ++i ) {
        if ( ( 1 << i & P ) > 0 ) {
            sol *= N, sol %= MOD ;
        }

        N *= N, N %= MOD ;
    }

    return sol ;
}

void ssnd ( void ) {
    scanf ( "%lld", &N ) ;

    int	NR = 1, SUM = 1;

    for ( int i = 1; 1LL * P[i] * P[i] <= N && i <= K; ++i ) {
        if ( N % P[i] == 0 ) {
            int p ;

            for ( p = 0 ; N % P[i] == 0; N /= P[i], ++p ) ;

            NR *= p + 1 ;

            SUM *= pow ( P[i], p + 1 ) - 1, SUM %= MOD ;
            SUM *= pow ( P[i] - 1, MOD - 2 ) , SUM %= MOD ;
        }
    }


    if ( N > 1 ) {
        NR <<= 1 ;
        SUM *= ( N + 1 ) % MOD, SUM %= MOD ;
    }

    printf ( "%d %d\n", NR, SUM ) ;
}

int main ( void ) {
    freopen ( FIN, "r", stdin ) ;
    freopen ( FOU, "w", stdout ) ;

    prec () ;

    for ( scanf ( "%d", &T ) ; T ; --T ) {
        ssnd () ;
    }
}