#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
#define MAX 60
#define MOD 1000000007
#define INF 1000000000000000000

vector<int> p;
vector<bool> p_table(MAX+1,true);
void prime(){
  p_table.at(0)=false,p_table.at(1)=false;
  for(int i=2;i<=MAX;i++){
    if(p_table.at(i)){
      p.push_back(i);
      for(int j=2;i*j<=MAX;j++){
        p_table.at(i*j)=false;
      }
    }
  }
}
int M=1000000;
vector<int> is_perfect_power(M+1,0);
vector<vector<int>> sum;

int N;

ll my_pow(ll x,int n){
  ll ret=1;
  while(n>0){
    if((n&1)==1){
      ret=ret*x;
    }
    n>>=1;
    x=x*x;
  }
  return ret;
}

//x以下の累乗数の個数
ll counting(ll x){
  if(x==0){
    return 0;
  }
  ll ans=1;
  for(int i=0;i<N;i++){
    int b=p[i];
    ll left=0;
    ll right=1000000001;
    while(left+1<right){
      ll c=(left+right)/2;
      if(log10(c)*(double)b>=100){
        right=c;
        continue;
      }
      if(pow((ll)c,b)>=2e18){
        right=c;
        continue;
      }
      if(my_pow(c,b)<=x){
        left=c;
      }else{
        right=c;
      }
    }
    if(i>0){
      ans+=left-sum[i-1][left];
    }else{
      ans+=left-1;
    }
  }
  return ans;
}

void solve(){
  ll K;
  cin>>K;
  ll left=0;
  ll right=1000000000000000001;
  while(left+1<right){
    ll c=(left+right)/2;
    if(counting(c)<K){
      left=c;
    }else{
      right=c;
    }
  }
  cout<<right<<'\n';
}

int main(){
  int T;
  cin>>T;
  prime();
  N=p.size();

  is_perfect_power[1]=1;
  sum.resize(N);
  for(int i=0;i<N;i++){
    sum[i].resize(M+1,0);
  }
  for(int i=0;i<N;i++){
    for(int j=2;pow(j,p[i])<=2e18&&my_pow(j,p[i])<=M;j++){
      is_perfect_power[my_pow(j,p[i])]=1;
    }
    for(int j=1;j<=M;j++){
      sum[i][j]=sum[i][j-1]+is_perfect_power[j];
    }
  }

  for(int i=0;i<T;i++){
    solve();
  }
}