#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const double PI = 3.141592653589793;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll T;
  cin >> T;
  ll before = 0;
  ll M = 10000010;
  vector<ll> dp(M);
  vector<bool> already(M, false);
  for (ll i = 0; i < M; ++i) {
    dp.at(i) = i;
  }
  for (ll i = 2; i < M; ++i) {
    if (already.at(i)) {
      continue;
    }
    ll cnt = 1;
    while (cnt * i < M) {
      dp.at(cnt * i) /= i;
      dp.at(cnt * i) *= i - 1;
      already.at(cnt * i) = true;
      cnt += 1;
    }
  }
  vector<ll> dp2(M, 0);
  for (ll i = 2; i < M; ++i) {
    dp2.at(i) = (i - 1) * 2 - (dp.at(i));
  }
  for (ll i = 0; i < M - 1; ++i) {
    dp2.at(i + 1) += dp2.at(i);
  }
  // for (ll i = 0; i < 10; ++i) {
  //   cout << dp.at(i) << " ";
  // }
  // cout << "\n";
  // for (ll i = 0; i < 10; ++i) {
  //   cout << dp2.at(i) << " ";
  // }
  // cout << "\n";
  for (ll testcase = 0; testcase < T; ++testcase) {
    ll N;
    cin >> N;
    cout << dp2.at(N) << "\n";
  }
}