#include <bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
vll P = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61 };
bool isOK(ll index, ll key) {
    ll k = 1;
    rep(p, P.size()) {
        ll D = pow(index, double(1) / double(P[p]));
        k += (D-1);
    }
    return (k < key);


}

// 汎用的な二分探索のテンプレ
ll binary_search(ll key) {
    ll ng = -1; //「index = 0」が条件を満たすこともあるので、初期値は -1
    ll ok = 1e18; // 「index = a.size()-1」が条件を満たさないこともあるので、初期値は a.size()

    /* ok と ng のどちらが大きいかわからないことを考慮 */
    while (abs(ok - ng) > 1) {
        ll mid = (ok + ng) / 2;
        cout << "";
        if (!isOK(mid, key)) ok = mid;
        else ng = mid;
    }
    return ok;
}

int main() {

	ll T;
	cin >> T;
	rep(t, T) {
        ll N;
        cin >> N;
        cout << binary_search(N) << endl;
	}
}