#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=n+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;
}

ll f(ll n,vector<ll>&a){
    ll p=upper_bound(all(a),n)-a.begin();
    p+=root(n,2);
    return p;
}

void solve(){
    ll t;cin>>t;
    vector<ll>a(0);
    REP(i,1,1e6+1){
        REP(j,3,60){
            ll d=1;
            rep(k,j){
                if(1e18/i>=d){
                    d=d*i;
                }else{
                    d=0;
                    break;
                }
            }
            ll m=root(d,2);
            if(m*m==d){
                d=0;
            }
            if(d){
                a.pb(d);
            }
        }
    }
    
    sort(all(a));
    a.erase(unique(all(a)),a.end());

    while(t--){
        ll k;cin>>k;
        ll l=0,r=inf;
        while(r-l>1){
            ll mid=(r+l)/2;
            ll fn=f(mid,a);
            if(fn<k)l=mid;
            else r=mid;
        }
        cout<<r<<endl;
    }
}

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