#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;

vector<long long> P = {2,3,5,7,11,13,17,19,23,29,31};

void solve(){
    long long X, Y, M=1, N, cnt;
    cin >> X;
    Y = X;

    for (int i=0; i<11; i++){
        cnt = 0;
        while(Y % P[i] == 0){
            cnt++;
            Y /= P[i];
        }
        M *= (cnt+1);
    }

    for (int i=2; i<=31; i++){
        Y = X*i;
        N = 1;
        for (int j=0; j<11; j++){
            cnt = 0;
            while(Y % P[j] == 0){ 
                cnt++;
                Y /= P[j];
            }
            N *= (cnt+1);
        }
        if (N % M == 0 && N / M == 2){
            cout << X*i << endl;
            return;
        }
    }
}

int main(){

    int T;
    cin >> T;

    while(T){
        solve();
        T--;
    }

    return 0;
}