#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

void solve() {
  ll n;
  cin >> n;
  map<ll, bool> seen;
  ll bd = floor(sqrt(n));
  ll rem = max(n - bd, 0LL);
  ll ans = n * n;  // a = c = 1

  for (ll i = 2; i <= bd; i++) {
    if (seen[i]) {
      continue;
    }
    seen[i] = true;
    ll t = i;
    ll cnt = 0;
    while (t <= n) {
      t *= i;
      seen[t] = true;
      if (t > bd) {
        rem = max(rem - 1, 0LL);
      }
      cnt++;
    }
    FOR(j, 1, cnt + 1) FOR(k, 1, cnt + 1) {
      ll u = max(j, k) / gcd(j, k);
      ans += n / u;
    }
  }
  ans += rem * n;
  cout << ans << endl;
}

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