#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

constexpr int M = 59;

ll pow(ll a, int b) {
  ll x = 1;
  while (b--) {
    if (x > LINF / a) return LINF;
    x *= a;
  }
  return x;
}

void solve() {
  int k; cin >> k;
  ll lb = 0, ub = 1LL * k * k;
  while (ub - lb > 1) {
    ll mid = (lb + ub) / 2;
    ll a = 1, num[M + 1]{};
    for (int i = M; i >= 2; --i) {
      ll lb2 = a, ub2 = mid;
      while (ub2 - lb2 > 1) {
        ll mid2 = (lb2 + ub2) / 2;
        (pow(mid2, i) <= mid ? lb2 : ub2) = mid2;
      }
      a = lb2;
      num[i] = a - 1;
      for (int j = 2; i * j <= M; ++j) {
        num[i] -= num[i * j];
      }
    }
    (accumulate(num, num + (M + 1), 0LL) + 1 >= k ? ub : lb) = mid;
  }
  cout << ub << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}