#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
template<class T> struct cLtraits_identity{
  using type = T;
}
;
template<class T> using cLtraits_try_make_signed =
  typename conditional<
    is_integral<T>::value,
    make_signed<T>,
    cLtraits_identity<T>
    >::type;
template <class S, class T> struct cLtraits_common_type{
  using tS = typename cLtraits_try_make_signed<S>::type;
  using tT = typename cLtraits_try_make_signed<T>::type;
  using type = typename common_type<tS,tT>::type;
}
;
template<class S, class T> inline auto max_L(S a, T b)
-> typename cLtraits_common_type<S,T>::type{
  return (typename cLtraits_common_type<S,T>::type) a >= (typename cLtraits_common_type<S,T>::type) b ? a : b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline int rd_int(void){
  int x;
  rd(x);
  return x;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class T> inline T pow2_L(T a){
  return a*a;
}
template<class T, class S> inline T pow_L(T a, S b){
  T res = 1;
  res = 1;
  for(;;){
    if(b&1){
      res *= a;
    }
    b >>= 1;
    if(b==0){
      break;
    }
    a *= a;
  }
  return res;
}
inline double pow_L(double a, double b){
  return pow(a,b);
}
inline long long Isqrt_f_L(const long long n){
  long long r = sqrt(n);
  r =max_L(r-2, 0);
  while((pow2_L((r+1)))<= n ){
    r++;
  }
  return r;
}
long long Ikthroot(long long N, long long k){
  long long res;
  if(k==1){
    return N;
  }
  if(k==2){
    return Isqrt_f_L(N);
  }
  res = pow(N, 1.0 / k);
  if((pow_L((res+1),k))<= N ){
    res++;
  }
  return res;
}
int main(){
  int cTE1_r3A, i;
  int chk[70] = {};
  for(i=(1);i<(10);i++){
    int j;
    for(j=(2);j<(10);j++){
      int k;
      k =(pow_L(i,j));
      if(k < 70){
        chk[k] = 1;
      }
    }
  }
  int RZTsC2BF = rd_int();
  for(cTE1_r3A=(0);cTE1_r3A<(RZTsC2BF);cTE1_r3A++){
    long long K;
    rd(K);
    long long res;
    long long cnt;
    long long k;
    long long WYIGIcGE;
    long long t_ynMSdg;
    long long KrdatlYV;
    WYIGIcGE = 1;
    t_ynMSdg = 1000000000000000000LL;
    while(WYIGIcGE < t_ynMSdg){
      if((WYIGIcGE + t_ynMSdg)%2==0){
        KrdatlYV = (WYIGIcGE + t_ynMSdg) / 2;
      }
      else{
        KrdatlYV = (WYIGIcGE + t_ynMSdg - 1) / 2;
      }
      cnt = 1;
      for(i=(1);i<(60);i++){
        if(!chk[i]){
          cnt += Ikthroot(KrdatlYV,i) - 1;
        }
      }
      if(cnt >= K){
        t_ynMSdg = KrdatlYV;
      }
      else{
        WYIGIcGE = KrdatlYV + 1;
      }
    }
    res =t_ynMSdg;
    wt_L(res);
    wt_L('\n');
  }
  return 0;
}
// cLay version 20210819-1 [beta]

// --- original code ---
// ll Ikthroot(ll N, ll k){
//   ll res;
//   if(k==1) return N;
//   if(k==2) return Isqrt_f(N);
//   res = pow(N, 1.0 / k);
//   if( (res+1) ** k <= N ) res++;
//   return res;
// }
// 
// {
//   int chk[70] = {};
//   rep(i,1,10) rep(j,2,10){
//     int k;
//     k = i ** j;
//     if(k < 70) chk[k] = 1;
//   }
//   REP(rd_int()){
//     ll @K, res, cnt, k;
//     res = bsearch_min[ll,x,1,1d18][
//       cnt = 1;
//       rep(i,1,60) if(!chk[i]) cnt += Ikthroot(x,i) - 1;
//     ](cnt >= K);
//     wt(res);
//   }
// }