#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n; cin >> n;
  int sq = 2;
  for (; sq * sq <= n; ++sq);
  ll ans = 1LL * n * n + 1LL * (n - sq + 1) * n;
  vector<bool> rem(sq, true);
  FOR(i, 2, sq) {
    if (!rem[i]) continue;
    // ll prev = ans;
    int r = 1;
    for (ll now = i; now <= n; now *= i, ++r) {
      if (now >= sq) {
        ans -= n;
      } else {
        rem[now] = false;
      }
    }
    ans += 1LL * n * (r - 1);
    FOR(j, 1, r) FOR(k, j + 1, r) ans += n / (lcm(1LL * j, 1LL * k) / j) * 2;
    // cout << i << ' ' << ans - prev << '\n';
  }
  cout << ans << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}