[bzoj3944]Sum

#include<bits/stdc++.h>
#include<tr1/unordered_map>
using namespace std;
#define ll long long 
#define N 5000005
int t,n,mu[N],vis[N],p[N];
ll cp[N];
tr1::unordered_map<int,ll>m1;
tr1::unordered_map<int,int>m2;
ll djs_cp(int n){
    if (n<=N-5)return cp[n];
    if (m1[n])return m1[n];
    ll ans=(n+1LL)*n/2;
    for(int i=2,j;;i=j+1){
        j=n/(n/i);
        ans-=djs_cp(n/i)*(j-i+1);
        if (j==n)return m1[n]=ans;
    }
}
int djs_mu(int n){
    if (n<=N-5)return mu[n];
    if (m2[n])return m2[n];
    int ans=1;
    for(int i=2,j;;i=j+1){
        j=n/(n/i);
        ans-=djs_mu(n/i)*(j-i+1);
        if (j==n)return m2[n]=ans;
    }
}
int main(){
   mu[1]=cp[1]=1;
   for(int i=2;i<=N-5;i++){
      if (!vis[i])cp[i]=i+(mu[p[++p[0]]=i]=-1);
      for(int j=1;(j<=p[0])&&(i*p[j]<=N-5);j++){
          vis[i*p[j]]=1;
          if (i%p[j]==0){
              cp[i*p[j]]=cp[i]*p[j];
              break;
          }
          mu[i*p[j]]=-mu[i];
          cp[i*p[j]]=cp[i]*(p[j]-1);
      }
   }
   for(int i=2;i<=N-5;i++){
       mu[i]+=mu[i-1];
       cp[i]+=cp[i-1];
   }
    scanf("%d",&t);
    while (t--){
        scanf("%d",&n);
        printf("%lld %d\n",djs_cp(n),djs_mu(n));
    }
}