#include<bits/stdc++.h>
using namespace std;
const int N = 2500010;
struct lpl{
    long long PHI, MU;
};
bool not_prime[N];
long long n, tot, prime[N], phi[N], mu[N];
map<int, lpl> LPL;

inline void prepare()
{
    mu[1] = 1; phi[1] = 1;
    for(register int i = 2; i < N; ++i){
        if(!not_prime[i]){
            prime[++tot] = i; mu[i] = -1; phi[i] = i - 1;
        }
        for(register int now, j = 1; prime[j] * i < N; ++j){
            now = prime[j] * i; not_prime[now] = true;
            if(i % prime[j] == 0){
                mu[now] = 0; phi[now] = prime[j] * phi[i];
                break;
            }
            mu[now] = -mu[i]; phi[now] = phi[i] * (prime[j] - 1);
        }
    }
    for(register int i = 2; i < N; ++i) phi[i] += phi[i - 1], mu[i] += mu[i - 1];
}

lpl Query(long long t)
{   
    lpl ld;
    if(t < N){ld.PHI = phi[t]; ld.MU = mu[t]; return ld;}
    if(LPL[t].PHI) return LPL[t];
    long long last; long long ret1 = (t * (t + 1)) >> 1, ret2 = 1;
    for(register long long i = 2; i <= t; i = last + 1){
        last = min(t, t / (t / i)); ld = Query(t / i);
        ret1 -= (last - i + 1) * ld.PHI; ret2 -= (last - i + 1) * ld.MU;
    }
    ld.PHI = ret1; ld.MU = ret2; LPL[t] = ld; 
    return ld;
}

int main()
{
    prepare();
    int T; lpl ld; scanf("%d", &T);
    while(T--){
        scanf("%lld", &n); ld = Query(n);
        printf("%lld %lld\n", ld.PHI, ld.MU);   
    }
    return 0;
}