#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

vector<int> primes={2,3,5,7,11,13,17,19,23,29,31,37};
int M=40;
int L=12;
vector<vector<int>> table(M,vector<int>(L));

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	rep(i,M){
		if(i==0) continue;
		int x=i;
		rep(j,L){
			while(x%primes[j]==0) table[i][j]++,x/=primes[j];
		}
	}
	int t=1;
	cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll X;
	cin>>X;
	vector<int> p(L);
	ll D=X;
	rep(i,L){
		while(D%primes[i]==0) p[i]++,D/=primes[i];
	}
	ll ans=1;
	while(ans++,true){
		int u=1,d=1;
		rep(i,L){
			if(table[ans][i]!=0){
				u*=(table[ans][i]+1+p[i]);
				d*=(1+p[i]);
			}
		}
		if(u==d*2){
			cout<<ans*X<<"\n";
			return ;
		}
	}
}