#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;

ll gcd(ll i,ll j){
        if(j == 0) return i;
        return gcd(j,i%j);
}

long long int_pow(long long a, long long b){
        bitset<30> bit(b);
        string s = bit.to_string();
        long long ret = 1;
        for (int i = 0;i< s.length(); ++i){
                ret = (ret * ret);
                if(s[i]-'0') ret = (ret * a) ;
        }
        return ret;
}


void solve(){
    ll n;
    cin >> n;
    vector<int> POW_ok(36,1);
    ll ans = n*n;
    POW_ok[1] = n;
    for(int i=2;i<36;i++){
        while(int_pow(POW_ok[i],i) <= n) POW_ok[i] ++;
        POW_ok[i]--;
    }
    for(int i=1;i<=35;i++){
        for(int j=1;j<=35;j++){
            if(gcd(i,j) > 1) continue;
            ll res = min(POW_ok[i]-1,POW_ok[j]-1);
            res *= n/max(i,j);
            ans += res;
        }
    }
    cout << ans << endl;
    return;
}

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