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

constexpr int max_val = 1e7;
long long tot[max_val + 1];
long long ans[max_val + 1];

void solve() {
    for (int i = 1; i <= max_val; i++) tot[i] = i;
    for (int i = 2; i <= max_val; i++) {
        if (tot[i] == i) {
            tot[i]--;
            for (int j = i + i; j <= max_val; j += i) {
                tot[j] = tot[j] / i * (i - 1);
            }
        }
    }
    for (int i = 1; i < max_val; i++) {
        ans[i + 1] = ans[i] + i + i - tot[i + 1];
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int T; cin >> T;
    solve();
    while (T--) {
        int n; cin >> n; cout << ans[n] << "\n";
    }
    return 0;
}