#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
void lldebug(vector<long long>v) {
	rep(i, v.size()) cout << v[i] << " ";
	cout << endl;
}
bool f2(long long x, int y, long long z) {
	//	true:x^y <= z
	long long mul = 1;
	long long sub = x;
	bool over = false;
	while (y > 0) {
		if (1 == y % 2) {
			if (over) return false;
			if (mul > (z / sub)) return false;
			else mul *= sub;
		}
		y /= 2;
		if (!over && (sub > (z / sub))) over = true;
		sub *= sub;
	}
	return  true;
}
long long calc(int x, long long y) {
	// x^? <= y なmax 
	long long ok = 0;
	long long ng = LINF + 1;
	while (1 < abs(ok - ng)) {
		long long c = (ng + ok) / 2;
		if (f2(c, x, y)) ok = c;
		else ng = c;
	}
	return ok;
}
bool f(long long x, long long k) {
	long long count = 1;
	vector<long long>c(61);
	//c[0]とc[1]はないよ
	rep2(i, 2, 61) c[i] = max(0LL, calc(i, x) - 1);
	rrep2(i, 2, 61)rep2(j, 2, i)if (0 == (i%j))c[j] -= c[i];
	rep2(i, 2, 61)count += c[i];
	return k <= count;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int k; cin >> k;
		long long ng = 0;
		long long ok = LINF + 1;
		while (1 < abs(ok - ng)) {
			long long c = (ng + ok) / 2;
			if (f(c, k)) ok = c;
			else ng = c;
		}
		cout << ok << endl;
	}
	return 0;
}