#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PL;
typedef pair<int,int> P;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const vector<int> dy = {-1,0,1,0};
const vector<int> dx = {0,1,0,-1};

ll root_int(ll a,int k) {
    if (k == 0) return 0;
    ll x = pow(a,(double)1.0/k);
    while (pow(x,k) > a) x --;
    while (pow(x + 1,k) <= a) x ++;
    return x;
}

int main() {
    ll t; cin >> t;
    rep(_,t) {
        ll n; cin >> n;
        ll ans = (n * n);
        for (int b = 1; b < 35;b ++) {
            for (int d = 1; d < 35; d ++) {
                if (__gcd(b,d) != 1) continue;
                int m = max(b,d);
                ll am = root_int(n,m);
                ll lim1 = max(am,1LL) - 1;
                ll lim2 = n/m;
                ans += (lim1 * lim2);
            }
        }
        cout << ans << endl;
    }
    return 0;
}