#include <stdio.h>
#include <math.h>
#include <vector>
#define int64 long long int

using namespace std;

vector<int64> PR;

void print_(int64 S, int64 ND) {
     printf("%lld %lld\n", ND, S);          
}

int64 my_pow(int64 b, int64 e) {
     if (e == 0) {
         return 1;   
     } else if (e == 1) {
         return b;       
     } 
     
     int64 aux = my_pow(b, e/2);
     if (e % 2 == 1) {
         return (aux * aux * b);   
     } else {
         return aux * aux;       
     }
}

void solve_(int64 nr, int64 &S, int64 &ND) {
     int64 DIV_NR;
     for (int i = 0; i < PR.size() && nr > 1; i++) {
         if (nr % PR[i] == 0) {
            DIV_NR = 0;
            while (nr % PR[i] == 0) {
                DIV_NR++;
                nr = nr / PR[i];      
            }
            ND *=  (DIV_NR + 1);
            S *= (my_pow(PR[i], DIV_NR + 1) - 1) / (PR[i] - 1);
         }    
     }          
} 

void read_() {
     int n;
     int64 nr;
     int64 S, P;
     
     scanf("%d", &n);
     for (int i = 0; i < n; i++) {
         scanf("%lld", &nr);
         S = 1; P = 1;
         solve_(nr, S, P);
         print_(S, P);
     }     
}

void marcheaza(int64 i, bool* bifat, int64 NMAX_P) {
      for (int64 j = i; j <= NMAX_P; j += i) {
          bifat[j] = true;
      }    
}

void getPrimes() {
     int64 NMAX_P = my_pow(10, 6) + 1;
     bool bifat[NMAX_P];
     for (int i = 2; i <= NMAX_P; i++) {
         bifat[i] = false;
     }     
     for (int64 i = 2; i <= NMAX_P; i++) {
         if (bifat[i] == false) {
             marcheaza(i, bifat, NMAX_P);             
             PR.push_back(i);
         }
     }
}

int main() {
    freopen("ssnd.in", "r", stdin);
    freopen("ssnd.out", "w", stdout);
    
    getPrimes();
    read_();
    
    return 0;
}