#include<bits/stdc++.h>
#include<random>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=1000000;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll root(ll n,ll i){
    ll l=0,r=1e9+1;
    while(r-l>1){
        bool f=1;
        ll d=1;
        ll mid=(r+l)/2;
        rep(j,i){
            if(n/mid>=d){
                d=mid*d;
            }else{
                f=0;
                break;
            }
        }
        if(f)l=mid;
        else r=mid;
    }
    return l;
}

vector<int> moebius(int n) {
    vector<int> res(n,1), p(n);
    for(int i = 2; i < n; i++){
        if(p[i] != 0)continue;
        p[i]=i;
        res[i] = -1;
        for(int j = i * 2; j < n; j += i) {
            if((j / i) % i == 0){
                res[j] = 0;
            }
            res[j] = -res[j];
            if(p[j]==0)p[j]=i;
        }
    }
    return res;
}

void solve(){
    auto mob=moebius(60);
    vector<ll>a(60);
    ll t;cin>>t;
    while(t--){
        ll k;cin>>k;
        ll l=0,r=k*k;
        while(r-l>1){
            ll mid=(r+l)/2;
            ll sum=0;
            for(int i=59;i>=2;i--){
                sum -= mob[i]*(root(mid,i)-1);
            }
            if(sum>=k-1)r=mid;
            else l=mid;
            //cout<<mid<<' '<<sum<<endl;
        }
        cout<<r<<endl;
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    //cout<<f(1)<<endl;
}