#include <bits/stdc++.h>
using namespace std;
int main(){
    int testcase;
    cin >> testcase;
    vector<int> prime(100, -1);
    for(int i = 2; i < 100; i++){
        if(prime[i] != -1) continue;
        int t = i;
        prime[i] = i;
        while(t + i < 100){
            t += i;
            prime[t] = i;
        }
    }
    while(testcase--){
        long long X;
        cin >> X;
        if(X == 1){
            cout << 2 << endl;
            continue;
        }
        long long temp = 1000000000000000000;
        for(long long i = 0; i < 100; i++){
            if(prime[i] == i && X % i != 0){
                temp = min(temp, i);
            }
            if(prime[i] == i && X % i == 0){
                long long t = X;
                long long po = 1;
                while(t % i == 0){
                    po *= i;
                    t /= i;
                }
                temp = min(temp, po * i);
            }
        }
        cout << X * temp << endl;
    }
}