#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll T;cin>>T;
  REP(t,T){
    ll K,L=1,R;cin>>K;R=K*K;
    while(L!=R){
      ll M=(L+R)/2,k=1,s=2,p=1;while(s<=M){s*=2;p++;}
      FOR(i,1,p){
        ll d=2,res=0,N=i;
        while(d*d<=N){if(N%d==0){N/=d;if(N%d==0){N=1;res=0;break;}res++;}d++;}
        if(N>1)res++;
        if(res){
          ll x=pow(M,1/(ld)i);while(pow(x,i)>M)x--;while(pow(x+1,i)<=M)x++;x--;
          if(res%2)k+=x;else k-=x;
        }
      }
      if(k<K)L=M+1;else R=M;
    }
    cout<<L<<endl;
  }
  return 0;
}