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

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

const int MAXN = 10000001;

vector<int> euler_phi_table(int n) {
    vector<int> euler(n + 1);
    for(int i = 0; i <= n; i++) {
        euler[i] = i;
    }
    for(int i = 2; i <= n; i++) {
        if(euler[i] == i) {
            for(int j = i; j <= n; j += i) {
                euler[j] = euler[j] / i * (i - 1);
            }
        }
    }
    return euler;
}

vector<int> tot(MAXN);

void init() {
    vi table = euler_phi_table(MAXN);
    repi(i, 2, MAXN) {
        tot[i] = tot[i-1];
        tot[i] += table[i];
    }
}

void solve() {
    int n;
    cin >> n;
    cout << n*(n-1) - tot[n] << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    init();
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}