#include "bits/stdc++.h"
#define int long long

using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
map<ll, ll> prime_factor(ll n) {
	map<ll, ll> ret;
	for (ll i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			ret[i]++;
			n /= i;
		}
	}
	if (n != 1) ret[n] = 1;
	return ret;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	vector<int> a = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41 };
	int s = 13;
	int T; cin >> T;
	for (int _ = 0; _ < T; _++) {
		int X; cin >> X;
		int t = X;
		vector<int>c(45);
		for (int i = 0; i < s; i++) {
			int cnt = 0;
			while (X % a[i] == 0) {
				X /= a[i];
				cnt++;
			}
			c[a[i]] = cnt;
			X = t;
		}
		for (int i = 2; i <= 40; i++) {
			auto p = prime_factor(i);
			int a = 1, b = 1;
			for (auto x : p) {
				int cnt = c[x.first] + 1;
				a *= cnt;
				cnt += x.second;
				b *= cnt;
			}
			if (a * 2 == b) {
				cout << X * i << endl; break;
			}
		}
	}
	return 0;


}