#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<ll,ll> memo;
ll sum_of_totient(ll N){
    if (memo.find(N)!=memo.end()){
        return memo[N];
    }
    if (N==1){
        return 1;
    }
    else if(N==2){
        return 2;
    }
    ll tmp=N-1;
    ll ans=((N*(N+1)))/2;
    ll k=1;
    while(N/k>N/(k+1)){
        tmp-=(N/k)-(N/(k+1));
        ans-=((N/k)-(N/(k+1)))*sum_of_totient(k);
        k++;
    }
    ll i=2;
    while(tmp>0){
        tmp--;
        ans-=sum_of_totient(N/i);
        i++;
    }
    memo[N]=ans;
    return ans;
}
ll solve(ll N){
    ll res=sum_of_totient(N)*2-1;
    ll ans=(2*N*N-res);
    ans-=2*N-1;
    ans/=2;
    return ans;
}
int main(void){
    int T;
    cin>>T;
    for (int i=0;i<T;i++){
        ll N;
        cin>>N;
        cout<<solve(N)<<endl;
    }
    return 0;
}