#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll INF = 1024000000000000000;

int main() {
    // 事前に、累乗の上限を求めておく
    vector<ll> rui_limit(62, 1);
    rui_limit[2] = 1000000000;
    rui_limit[3] = 1000000;
    rui_limit[4] = 32000;
    for (ll i = 4; i <= 59; i++) {
        for (ll j = 2; j <= 32000; j++) {
            bool safe = true;
            ll now = 1;
            for (ll k = 0; k < i; k++) {
                if (now > INF / j) {
                    safe = false;
                    break;
                }
                now *= j;
            }
            if (safe) {
                rui_limit[i] = j;
            }
        }
    }
    // debug(rui_limit);
    vector<bool> isprime(62, true);
    for (ll i = 2; i <= 61; i++) {
        for (ll j = 2; j < i; j++) {
            if (i % j == 0) {
                isprime[i] = false;
            }
        }
    }

    ll T;
    cin >> T;
    while (T--) {
        ll K;
        cin >> K;
        // 累乗数がこの数以上あるかどうかを、b を全探索して確認する
        // ただし，b のほうが素数でなければならないという制約もある
        ll ng = 0;
        ll ok = INF;
        while (ok - ng > 1) {
            ll mid = (ok + ng) / 2;
            ll cnt = 1;
            for (ll b = 2; b <= 59; b++) {
                if (!isprime[b]) {
                    continue;
                }
                ll ok2 = 0;
                ll ng2 = rui_limit[b] + 1;
                // debug_out(ok2, ng2);
                while (ng2 - ok2 > 1) {
                    ll mid2 = (ok2 + ng2) / 2;
                    if (my_pow(mid2, b, INF + 1) <= mid) {
                        ok2 = mid2;
                    } else {
                        ng2 = mid2;
                    }
                }
                cnt += (ok2 - 1);
                // debug_out(ok2, mid, b, cnt);
            }
            if (cnt >= K) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        cout << ok << endl;
    }
}