#include <fstream>
#include <cmath>
#define maxv 1000005
#include <algorithm>

using namespace std;

ifstream f ("ssnd.in");
ofstream g ("ssnd.out");

int n, i, v[ 1001 ], d, k, x, a, s;
int main() {
    f >> n;
    for( i = 1; i <= n; ++i )
        f >> v[ i ];
    for( i = 1; i <= n; ++i ){
        k = 0;
        x = v[ i ];
        a = int ( sqrt ( x ) );
        s = 0;
        for ( d = 1; d * d <= x; ++d )
            if ( x % d == 0 ){
                    s = s + d + x / d;
                    k = k + 2;
            }
        if( a * a == x ){
                s = s - a;
                --k;
        }
        g << k << ' ' << s << '\n';
    }
    return 0;
}