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

using namespace std;
typedef long long ll;

const ll MAX_N = 10000000;
ll table[10000010];
ll ans[MAX_N + 10];

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

  memset(table, 0, sizeof(table));
  for (ll n = 1; n <= MAX_N; ++n) {
    table[n] = n;
  }
  for (ll n = 2; n <= MAX_N; ++n) {
    if (table[n] == n) {
      for (ll m = n; m <= MAX_N; m += n) {
        table[m] = table[m] / n * (n - 1);
      }
    }
  }

  table[1] = 1;
  memset(ans, 0, sizeof(ans));
  for (ll n = 1; n <= MAX_N; ++n) {
    ans[n + 1] = ans[n] + 2 * n - table[n + 1];
  }

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

    cout << ans[N] << endl;
  }

  return 0;
}