#include <bits/stdc++.h>
using namespace std;
#define bokusunny ios::sync_with_stdio(false), cin.tie(nullptr);

template <class T>
vector<pair<T, int>> prime_factorize(T N) {
  vector<pair<T, int>> res;
  for (T i = 2; i * i <= N; i++) {
    if (N % i != 0) continue;
    int ex = 0;
    while (N % i == 0) {
      ex++;
      N /= i;
    }
    res.push_back({i, ex});
  }

  if (N != 1) res.push_back({N, 1});
  return res;
}

void solve() {
  long long X;
  cin >> X;

  const int MX = 40;
  for (int i = 2; i <= MX; i++) {
    auto XX = X;
    auto pf = prime_factorize(i);
    long long deno = 1;
    long long num = 1;
    for (auto &[p, ex] : pf) {
      int cnt = 0;
      while (XX % p == 0) {
        cnt++;
        XX /= p;
      }
      deno *= cnt + ex + 1;
      num *= cnt + 1;
    }

    if (deno % num == 0 && deno / num == 2) {
      cout << X * i << endl;
      break;
    }
  }
}

int main() {
  bokusunny;

  int t;
  cin >> t;
  while (t--) solve();

  return 0;
}