/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
vll factor(ll M){
    vll fac;
    if(M == 1){
        fac.push_back(1); return fac;
    }
    for(ll i = 2; i*i <= M; i++){
        while(M % i == 0){
            fac.push_back(i); M /= i;
        }
    }
    if(M != 1) fac.push_back(M);
    sort(fac.begin(), fac.end());
    return fac;
}


void solve3(){
    ll N;
    cin >> N;
    rep(i,2,100){
        vll d = factor(i);
        if(d.size() == 1){
            if(N % i != 0){
                print(N*i);
                return;
            }
        }else if(d.size() == 2 && d[0] != d[1]){
            vll cnt(2, 0);
            rep(j,0,2){
                ll v = N;
                while(v % d[j] == 0){
                    cnt[j]++;
                    v /= d[j];
                }
            }
            if(cnt[0] * cnt[1] == 2){
                print(N*i);
                return;
            }
        }else{
            ll sz = d.size();
            vll v2 = d;
            v2.erase(unique(v2.begin(), v2.end()), v2.end());
            if(v2.size() == 1){
                ll cnt = 0;
                ll v = N;
                while(v % v2[0] == 0){
                    cnt++;
                    v /= v2[0];
                }
                if(cnt == sz-1){
                    print(N*i);
                    return;
                }

            }
        }
    }

}


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll t;
    cin >> t;
    while(t--) solve3();
}