#include<iostream>
#include<vector>
#include<cmath>
#include<map>
#include<algorithm>
using namespace std;
using lli = long long int;
using pii = std::pair<lli, lli>;


int main(){
    lli t;
    cin >> t;
    for(int i = 0; i < t; i++) {
        lli x;
        cin >> x;
        // cout << x << endl;;
        bool flag = false;
        int cnt = 0;
        int ans = 1e9;
        for(int i = 2; i <= 35 and not flag; i++) {
            if(x%i != 0){
                ans = min(ans, i);
                flag = true;
            }            
            cnt = i+1;
        }
        if(not flag)ans = min(ans, cnt);

        vector<int> c(3, 0), d(3);
        d[0] = 2, d[1] = 3, d[2] = 5;
        for(int i = 0; i < c.size(); i++) {
            lli tmp = x;
            while(tmp%d[i] == 0){
                tmp /= d[i];
                c[i]++;
            }
            if(c[i] > 0) ans = min(ans, (int)pow(d[i], (c[i]+1)));
        }
        cout << ans*x << endl;
    }
}