//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;  using vvi = vector<vi>;
using vl = vector<ll>;   using vvl = vector<vl>;
using vb = vector<bool>; using vvb = vector<vb>;
using vpi = vector<pii>; using vvpi = vector<vpi>;
using vpl = vector<pll>; using vvpl = vector<vpl>;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
#define rep(i,m,n) for (int i = m; i < (int)(n); i++)
#define rrep(i,m,n) for (int i = m; i > (int)(n); i--)

ll p(ll x,ll y){
    ll ju = 1;
    rep(i,0,y){
        if (ju > INF/double(x)) return INF;
        ju *= x;
    }
    return ju;
}

ll cnt_i(ll x,int i){
    ll ok = 0,ng = floor(pow(x,1/(long double)(i)))+10;
    while (ng-ok > 1){
        ll mid = (ok+ng)/2;
        if (p(mid,i) <= x) ok = mid;
        else ng = mid;
    }
    return ok-1;
}

bool f(ll x,ll k){
    ll ju = 0;
    vl cnt(61);
    rrep(i,60,1){
        ll c = cnt_i(x,i);
        for (int j = 2*i; j <= 60; j += i){
            c -= cnt[j];
        }
        cnt[i] = c;
        ju += c;
    }
    if (ju >= k-1) return true;
    else return false;
}

void solve(){
    ll k; cin >> k;
    ll ng = 0,ok = 1e18+1;
    while (ok-ng > 1){
        ll mid = (ok+ng)/2;
        if (f(mid,k)) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}

int main(){
    int t; cin >> t;
    rep(i,0,t){
        solve();
    }
}