#include <iostream>
#include <vector>
#include <cmath>
#include <cstring>

using namespace std;
typedef long long ll;

ll euler_phi(ll n) {
  ll ret = n;
  for (ll i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ret -= ret / i;
      while (n % i == 0) {
        n /= i;
      }
    }
  }
  if(n > 1) {
    ret -= ret / n;
  }
  return ret;
}

ll sum[10000010];

int main() {
  int T;
  cin >> T;

  memset(sum, 0, sizeof(sum));
  for (ll n = 2; n <= 10000000; ++n) {
    sum[n] = sum[n - 1] + euler_phi(n);
  }

  for (int i = 0; i < T; ++i) {
    ll N;
    cin >> N;

    ll all = (N - 1) * N / 2;
    ll ans = all + (all - sum[N]);
    cout << ans << endl;
  }

  return 0;
}