#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int N=11;
vector<ll> p = {2,3,5,7,11,13,17,19,23,29,31};

ll mod_exp(ll b, ll e, ll m=1e18){
    if (e > 0 && b == 0) return 0;
    ll ans = 1;
    b %= m;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b*b) % m;
    }

    return ans;
}

void solve(){
    ll X, Y, e, mi=1e18;
    cin >> X;
    Y = X;
    for (int i=0; i<N; i++){
        e = 0;
        while(Y % p[i] == 0){
            Y /= p[i];
            e++;
        }
        mi = min(mi, mod_exp(p[i], e+1));
    }

    cout << mi * X << endl;
}

int main(){

    int T;
    cin >> T;
    while(T){
        T--;
        solve();
    }

    return 0;
}