/* -*- coding: utf-8 -*-
 *
 * 1611.cc:  No.1611 Minimum Multiple with Double Divisors - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 320000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef pair<ll,int> pli;
typedef vector<pli> vpli;

/* global variables */

bool primes[MAX_P + 1];

/* subroutines */

int gen_primes(int maxp, vi &pnums) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

bool prime_decomp(ll n, vi &pnums, vpli& pds) {
  pds.clear();

  int pn = pnums.size();
  for (int i = 0; i < pn; i++) {
    int pi = pnums[i];
    if ((ll)pi * pi > n) {
      if (n > 1) pds.push_back(pli(n, 1));
      return true;
    }

    if (n % pi == 0) {
      int fi = 0;
      while (n % pi == 0) n /= pi, fi++;
      pds.push_back(pli(pi, fi));
    }
  }
  return false;
}

ll powll(ll a, int n) {  // a^n % MOD
  ll pm = 1;
  while (n > 0) {
    if (n & 1) pm *= a;
    a *= a;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  vi pnums;
  int pn = gen_primes(MAX_P, pnums);

  int tn;
  scanf("%d", &tn);

  while (tn--) {
    ll x;
    scanf("%lld", &x);

    vpli pds;
    prime_decomp(x, pnums, pds);

    int k = 0;
    for (; k < pds.size() && pnums[k] == pds[k].first; k++);

    ll minz = pnums[k];
    for (int i = 0; i < pds.size(); i++) {
      ll z = powll(pds[i].first, pds[i].second + 1);
      minz = min(minz, z);
    }

    printf("%lld\n", x * minz);
  }
  return 0;
}