#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  int T;
  cin >> T;
  vector<long long> A;
  for (int i = 2; i <= 1000000; i++){
    long long P = i;
    while (true){
      if (INF / P < i){
        break;
      }
      P *= i;
      long long tv = 0, fv = 1100000000;
      while (fv - tv > 1){
        long long mid = (tv + fv) / 2;
        if (mid * mid <= P){
          tv = mid;
        } else {
          fv = mid;
        }
      }
      if (P != tv * tv){
        A.push_back(P);
      }
    }
  }
  sort(A.begin(), A.end());
  A.erase(unique(A.begin(), A.end()), A.end());
  for (int i = 0; i < T; i++){
    int K;
    cin >> K;
    long long tv = (long long) K * K, fv = 0;
    while (tv - fv > 1){
      long long mid = (tv + fv) / 2;
      long long cnt = 0;
      long long tv2 = 0, fv2 = 1100000000;
      while (fv2 - tv2 > 1){
        long long mid2 = (tv2 + fv2) / 2;
        if (mid2 * mid2 <= mid){
          tv2 = mid2;
        } else {
          fv2 = mid2;
        }
      }
      if (tv2 >= 2){
        cnt += tv2 - 1;
      }
      cnt += upper_bound(A.begin(), A.end(), mid) - A.begin();
      if (mid >= 1){
        cnt++;
      }
      if (cnt >= K){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    cout << tv << endl;
  }
}