#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

i64 mypow(i64 a, i64 b){
    i64 res = 1;
    while (b--){
        res *= a;
    }
    return res;
}

int main(){
    int t;
    cin >> t;
    vector<i64> ans;
    vector<int> prime, table(100, 1);
    table[0] = table[1] = 0;
    rep(i, 100){
        if (table[i]){
            prime.emplace_back(i);
            for (int j = i + i; j < 100; j += i){
                table[j] = 0;
            }
        }
    }
    while (t--){
        i64 x;
        cin >> x;

        int k = -1;
        for (auto i: prime){
            if (x % i){
                k = i;
                break;
            }
        }
        for (auto e: prime){
            if (e >= k) break;
            int c = 0;
            i64 tmp = x;
            while (tmp % e == 0){
                tmp /= e;
                c++;
            }
            chmin(k, mypow(e, c + 1));
        }
        ans.emplace_back(x * k);
    }
    for (auto i: ans) cout << i << "\n";
}