#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;

const ll mod = 1000000007;

int main() {
    ll T;
    cin >>T;
    vector<ll> pr = {2,3,5,7,11,13,17,19,23,29,31,37,41};
    rep(ii,T){
        ll N; cin >> N;
        ll ans = 2e9;
        rep(i,40){
            double r = 1;
            rep(j,13){
                ll k = i+2;
                ll M = N;
                double cnt1 = 0,cnt2 = 0;
                while(M%pr[j]==0){
                    M /= pr[j]; cnt1++;
                }
                while(k%pr[j]==0){
                    k /= pr[j]; cnt2++;
                }
                r *= (double)(cnt2+cnt1+1)/(double)(cnt1+1);
            }
            //cout << i+2 << " " << r << endl;
            if(abs(r-2)<0.0001){
                ans = min(ans,(ll)i+2); break;
            }
        }
        cout << N*ans << endl;
    }
    //cout << ans << endl;
}