#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

ll solve() {
  vector<ll> array = {2, 3, 5, 7, 11, 13, 17, 19, 23};

  ll x; cin >> x;
  ll ans = 29;
  for (ll p : array) {
    ll e = 0;
    for (ll y = x; y % p == 0; y /= p, e++);
    // e + 1 + x = 2(e + 1)
    // x = e + 1
    ll cand = 1;
    for (int i = 0; i < e + 1; ++i) cand *= p;
    dump(p << " " << e << " " << cand);
    ans = min(cand, ans);
  }
  return ans * x;
}

int main() {
  cout << fixed << setprecision(12);
  int T; cin >> T;
  while (T--) cout << solve() << endl;
}