#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 % 2 == 1) cout << X * 2 << endl;
        else{
            long long res0 = 1000000000000000;
            for(long long i = 2; i < 100; i++){
                map<int, int> m, m2;
                int t = i;
                while(t != 1){
                    m[prime[t]]++;
                    t /= prime[t];
                }
                long long temp = X;
                for(auto [v, ko] : m){
                    while(temp % v == 0){
                        m2[v]++;
                        temp /= v;
                    }
                }
                long long res = 1;
                temp = 1;
                for(auto [v, ko] : m){
                    res *= (m2[v] + 1);
                    temp *= (m2[v] + ko + 1);
                }
                if(temp % res == 0 && temp / res == 2){
                    res0 = min(res0, i);
                }
            }
            cout << X * res0 << endl;
        }
    }
}