#include<iostream>
#include<algorithm>
#include<cstring>
#include<unordered_map>

using namespace std;

typedef long long LL;

const int N = 6000010;

int primes[N], cnt;
bool st[N];
int mu[N], sum1[N], phi[N];
LL sum2[N];
unordered_map<int, int> w1;
unordered_map<int, LL> w2;

void init(int n)
{
    mu[1] = phi[1] = 1;
    for(int i = 2; i <= n; i ++)
    {
        if(!st[i])
        {
            primes[cnt ++] = i;
            mu[i] = -1;
            phi[i] = i - 1;
        }

        for(int j = 0; primes[j] * i <= n; j ++)
        {
            st[primes[j] * i] = true;
            if(i % primes[j] == 0)
            {
                mu[primes[j] * i] = 0;
                phi[primes[j] * i] = primes[j] * phi[i];
                break;
            }
            mu[primes[j] * i] = -1 * mu[i];
            phi[primes[j] * i] = (primes[j] - 1) * phi[i];
        }
    }

    for(int i = 1; i <= n; i ++)
    {
        sum1[i] = sum1[i - 1] + mu[i];
        sum2[i] = sum2[i - 1] + phi[i];
    }
}

int g(int k, int x)
{
    return k / (k / x);
}

int djsmu(LL x)
{
    if(x < N) return sum1[x];
    if(w1[x]) return w1[x];

    int res = 1;
    for(LL l = 2, r; l <= x; l = r + 1)
    {
        r = g(x, l);
        res -= (r - l + 1) * djsmu(x / l); 
    }

    return w1[x] = res;
}

LL djsphi(LL x)
{
    if(x < N) return sum2[x];
    if(w2[x]) return w2[x];

    LL res = (LL)x * (x + 1) / 2;
    for(LL l = 2, r; l <= x; l = r + 1)
    {
        r = g(x, l);
        res -= (LL)(r - l + 1) * djsphi(x / l);
    }

    return w2[x] = res;
}

int main()
{
    init(N - 1);

    int T;
    scanf("%d", &T);

    while(T --)
    {
        LL n;
        scanf("%lld", &n);
        printf("%lld %d\n", djsphi(n), djsmu(n));
    }

    return 0;
}