#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/string>
#include <atcoder/segtree>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)



const i64 INF = 1001001001001001001;

i64 kthpow(i64 n, i64 k){
  i64 ans = 1;
  rep(i,k){
    if(INF/n < ans) return INF;
    ans *= n;
  }
  return min(INF,ans);
}


i64 kthroot(i64 n, i64 k){
  i64 l=0, r=INF;
  while(r-l > 1){
    i64 m = (l+r)/2;
    if(kthpow(m,k) <= n) l = m;
    else r = m;
  }
  //cout << "kthroot(" << n << "," << k << ") = " << l << endl;
  return l;
}


i64 solve(i64 x){
  if(x == 0) return 0;
  i64 ans = 1;
  for(i64 k=2; k<=100; k++) ans += kthroot(x,k) - 1;
  return ans;
}


void testcase(){
  i64 N; cin >> N; N++;
  i64 l = 0, r = INF;
  while(r-l > 1){
    i64 m = (l+r)/2;
    if(solve(m) < N) l = m;
    else r = m;
  }
  cout << r << "\n";
}


int main(){
  int T; cin >> T;
  rep(t,T) testcase();
  return 0;
}

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;