// Problem: No.2249 GCDistance
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2249
// Memory Limit: 512 MB
// Time Limit: 5000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e7;
ll ans[N + 1], p[N + 1], pre[N + 1], phi[N + 1];

void solve() {
  int x;
  cin >> x;
  cout << ans[x] << "\n";
}

int main() {
  fastio;
  int t = 1;
  for (ll i = 2; i <= N; i++) phi[i] = i;
  for (ll i = 2; i <= N; i++) {
    if (phi[i] == i) {
      for (ll j = i; j <= N; j += i) {
        phi[j] = phi[j] / i * (i - 1);
      }
    }
    pre[i] = pre[i - 1] + phi[i];
    ll all = i * (i - 1) / 2;
    ans[i] = pre[i] + 2 * (all - pre[i]);
  }
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}