#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=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;


signed main(){
    vector<ll>b(0);
    b.pb(1);

    REP(i,2,MAX){
        ll d=i;
        while(inf/i>=d){
            d=d*i;
            b.pb(d);
        }
    }
    ll cnt=0;
    sort(all(b));
    unique(all(b));
    rep(i,b.size()){
        if(sqrt(b[i])==(ll)sqrt(b[i])){
            if(sqrt(b[i])>MAX){
                swap(b[i],b[b.size()-1]);
                b.pop_back();
                swap(b[i],b[b.size()-1]);
            }
        }
    }
    ll t;cin>>t;
    while(t--){
        ll k;cin>>k;
        k--;
        ll l=0,r=inf;
        while(r-l>1){
            ll mid=(r+l)/2;
            ll p=upper_bound(all(b),mid)-b.begin();
            p+=max(0LL,mid-MAX);
            if(p>k)r=mid;
            else l=mid;
        }

        cout<<l+1<<endl;
    }
}