#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll sq(ll n,ll j){//n以下のj乗数の底を求める
  ll p=pow(n,1.0/j)-1;chmax(p,0LL);
  for(;;p++){
    ll ret=1;
    bool ok=true;
    rep(_,j){
      ret*=p;
      if(ret>n)ok=false;
    }
    if(!ok){
      p--;
      return p;
    }
  }
}
int main(){
  ll t;cin >>t;
  while(t--){
    ll n;cin >> n;
    ll ok=n*n,ng=0;
    while(ok-ng>1){
      ll mid=(ok+ng)/2;
      map<ll,ll> mp;
      for(int j=2;j<=60;j++){
        mp[j]=sq(mid,j)-1;
      }
      for(int j=60;j>=2;j--){
        for(int k=2;k<j;k++){
          if(j%k==0)mp[k]-=mp[j];
        }
      }
      ll ret=1;for(auto p:mp)ret+=p.second;
      if(ret>=n)ok=mid;
      else ng=mid;
    }
    cout << ok << endl;
  }
}