#include #include using namespace std; using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; using ll = long long; using ld = long double; using pll = pair; using tlll = tuple; constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {return (A % M + M) % M;} ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) ll isok(ll a, ll b, ll c) { ll tmp = 1; for (ll i = 0; i < b; i++) { if (tmp > c / a) return false; tmp *= a; } return true; } ll rt(ll b, ll c) { ll ok = 0, ng = 1e9 + 10; while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; if (isok(mid, b, c)) ok = mid; else ng = mid; } return ok; } vector mb = {0, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, 1, -1, 0, 0, 1, 0, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 1, 1, 0, -1, -1, -1, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 1, 0, 1, 1, -1, 0, -1, 1, 0, 0, 1, -1, -1, 0, 1, -1, -1, 0, -1, 1, 0, 0, 1, -1}; ll count(ll c) { ll ret = 0; for (ll b = 2; b < 64; b++) { ll tmp = -mb.at(b) * rt(b, c); ret += tmp; } return ret; } int main() { cerr << count(10) << endl; ll T; cin >> T; for (ll t = 0; t < T; t++) { ll K; cin >> K; ll ok = 0, ng = 1e18 + 10; while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; if (count(mid) <= K) ok = mid; else ng = mid; } cout << ok + 1 << '\n'; } }