// luogu-judger-enable-o2

 //minamoto

 #include<iostream>

 #include<cstdio>

 #include<map>

 #define ll long long

 using namespace std;

 const int N=1e5+,M=4e6+,limit=;

 map<ll,ll> _mu;

 map<ll,ll>::iterator ii;

 ll p[M],m,mu[M];int vis[M];

 void init(){

     mu[]=;

     for(ll i=;i<limit;++i){

         if(!vis[i]) p[++m]=i,mu[i]=-;

         for(int j=;j<=m&&i*p[j]<limit;++j){

             vis[i*p[j]]=;

             if(i%p[j]==){

                 mu[i*p[j]]=;

                 break;

             }

             mu[i*p[j]]=-mu[i];

         }

     }

     for(int i=;i<limit;++i)

     mu[i]+=mu[i-];

 }

 ll sum2(ll n){

     if(n<limit) return mu[n];

     if(_mu.count(n)) return _mu[n];

     ll ans=;

     for(int i=,r;i<=n;i=r+){

         r=n/(n/i);

         ans-=(r-i+)*sum2(n/i);

     }

     return _mu[n]=ans;

 }

 ll sum1(ll n){

     ll ans=;

     for(ll i=,r;i<=n;i=r+){

         r=n/(n/i);

         ans+=(n/i)*(n/i)*(sum2(r)-sum2(i-));

     }

     return ((ans-)>>)+;

 }

 int main(){

 //    freopen("testdata.in","r",stdin);

     init();

     ll T,n;scanf("%lld",&T);

     while(T--){

         scanf("%lld",&n);

         printf("%lld %lld\n",sum1(n),sum2(n));

     }

     return ;

 }