#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
void solve(){
      ll k;
      cin>>k;
      k--;
      if(k==0){
            cout<<1<<"\n";
            return;
      }
      ll l=0,r=1000000000000000000ll;
      while(r-l>1){
            ll mid=(l+r)/2;
            ll d=sqrt(mid)-3;
            while(1){
                  if((d+1)*(d+1)>mid)break;
                  d++;
            }
            ll a=0,b=d+10;
            while(b-a>1){
                  ll m=(a+b)/2;
                  if(m*m>mid/m)b=m;
                  else a=m;
            }
            b=a;
            b=max(b,2ll);
            ll v=0,u=b+10;
            while(u-v>1){
                  ll m=(u+v)/2;
                  if(m*m*m>mid/m)u=m;
                  else v=m;
            }
            u=v;
            u=max(u,2ll);
            ll cnt=0,rem=0;
            ll remd=0;
            for(ll i=2;i<=u;i++){
                  ll cp=i;
                  while(cp<=mid/i){
                        cnt++;
                        cp*=i;
                        if(u<cp&&cp<=b)remd++;
                        if(b<cp&&cp<=d)rem++;
                      //  if(mid==28)cout<<cp<<" "<<cnt<<"\n";
                  }
            }
            cnt+=max(0ll,b-u-remd)*2ll;
            cnt+=max(0ll,d-b-rem);
      //     if(mid<=40){
      //           cout<<u<<" "<<b<<" "<<d<<" "<<mid<<" "<<cnt<<"\n";
      //           cout<<remd<<" "<<max(0ll,b-u-remd)<<" "<<max(0ll,d-b-rem-t)<<"\n";
      //     }
            if(cnt>=k)r=mid;
            else l=mid;
      }
      cout<<r<<"\n";
}
int main(){
      int t;
      cin>>t;
      while(t--)solve();
}