#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P=pair<ll,ll>;
    const int INF=1001001001;
    const int mod=1e9+7;
    
    ll p[11]={2,3,5,7,11,13,17,19,23,29,31};

    auto f(ll x){
        ll tot=1;
        rep(i,11){
            ll cnt=0;
            while(x%p[i]==0){
                x/=p[i];
                cnt++;
            }
            tot*=cnt+1;
        }
        return tot;
    }
    void solve(){
        ll x;
        cin>>x;
        auto r=f(x);

        for(ll i=2;i<=31;i++){
            ll y=x*i;
            auto r2=f(y);
            if(r2/r==2){
                cout<<y<<endl;
                return;
            }
        }
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int t;
        cin>>t;
        rep(i,t){
            solve();   
        }

        return 0;
    }