#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;
            }
        }
        if(f)l=mid;
        else r=mid;
    }
    return l;
}

ll f(ll n){
    vector<ll>a(60);
    vector<ll>cnt(60);
    REP(i,2,60){
        a[i]=root(n,i);
        ll k=1;
        while(k*i<60){
            cnt[k*i]++;
            k++;
        }
    }
    ll ans=0;
    REP(i,2,60){
        a[i]--;
        if(cnt[i]%2)ans+=a[i];
        //else ans-=a[i];
    }
    return ans+1;
}

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

signed main(){
    solve();
    //cout<<f(16)<<endl;
}