#include <algorithm>
using namespace std;

#define INF 1LL<<50
#define MOD 9973

typedef long long int int_64;

int T;
int nr_div, sum_div;
int_64 N;

void solve() {

    int i, div_1, div_2;

    scanf( "%lld", &N );

    nr_div = 0;
    sum_div = 0;

    for( i = 1; (int_64)i * i <= N; ++i )
        if( N % i == 0 ) {

            div_1 = i % MOD;
            div_2 = (N/i) % MOD;

//            if( div_1 != div_2 ) {
//
//                nr_div += 2;
//                sum_div += div_1 + div_2;
//            }
//            else {
//
//                ++nr_div;
//                sum_div += div_1;
//            }

//            if( sum_div > INF )
//                sum_div = sum_div % MOD;
        }
//    sum_div = sum_div % MOD;

    printf( "%d %d\n", nr_div, sum_div );
}

int main() {

    freopen( "ssnd.in", "r", stdin );
    freopen( "ssnd.out", "w", stdout );

    scanf( "%d", &T );

    while( T-- )
        solve();

    return 0;
}