#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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;
  map<int, vector<int>> mp;
  int i = 2;
  for (; i * i <= n; ++i) {
    int ex = 2;
    ll now = i * i;
    while (now <= n) {
      mp[now].emplace_back(ex);
      ++ex;
      now *= i;
    }
  }
  ll ans = 1LL * n * n + 1LL * n * (n - 1);
  for (auto [ignore, e] : mp) {
    e.emplace_back(1);
    int sz = e.size();
    REP(i, sz) FOR(j, i + 1, sz) {
      if (i == j) continue;
      ans += min(n / e[i], n / e[j]) * 2;
    }
  }
  cout << ans << '\n';
}

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