#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")


#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>

template<typename T> void debug(T e){
    cerr << e << endl;
}

template<typename T> void debug(vector<T> &v){
    rep(i, v.size()){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

template<typename T> void debug(vector<vector<T>> &v){
    rep(i, v.size()){
        rep(j, v[i].size()){
            cerr << v[i][j] << " ";
        }
        cerr << endl;
    }
}

template<typename T> void debug(vector<pair<T, T>> &v){
    rep(i,v.size()){
        cerr << v[i].first << " " << v[i].second << endl;
    }
}

template<typename T> void debug(set<T> &st){
    for (auto itr = st.begin(); itr != st.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(multiset<T> &ms){
    for (auto itr = ms.begin(); itr != ms.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(map<T, T> &mp){
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out(){
    cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << H << " ";
    debug_out(T...);
}



int main(){
    // dist(x, y) は，gcd(x, y) = 1 なら 1，そうでないなら 2 になるはず
    // 互いに素な自然数の個数はオイラーのトーシェント関数を使えば求められる
    vl divisor(10000002, -1);
    for (ll i = 2; i <= 10000000; i++){
        for (ll j = 2; j * i <= 10000000; j++){
            divisor[j * i] = j;
        }
    }
    vl totient(10000002, 0);
    for (ll i = 2; i <= 10000000; i++){
        ll now = i;
        ll div = -1;
        ll tot = i;
        while(true){
            if (divisor[now] == -1){
                if (now != div){
                    tot = tot * (now - 1);
                    tot /= now;
                }
                break;
            }
            if (div != divisor[now]){
                div = divisor[now];
                tot = tot * (div - 1);
                tot /= div;
            }
            now /= div;
        }
        totient[i] = tot;
    }
    vl tot_sum(10000002, 0);
    for (ll i = 1; i <= 10000001; i++){
        tot_sum[i] = tot_sum[i - 1] + totient[i];
    }
    ll T;
    cin >> T;
    assert(1 <= T && T <= 200000);
    while(T--){
        ll N;
        cin >> N;
        assert(1 <= N && N <= 10000000);
        cout << N * (N - 1) - tot_sum[N] << endl;
    }
}