/* -*- coding: utf-8 -*-
 *
 * 3127.cc:  No.3127 Multiple of Twin Prime - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_P = 10000000;

/* typedef */

using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using vl = vector<ll>;

/* global variables */

vb primes;
vi pnums;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  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();
}

/* main */

int main() {
  int pn = gen_primes(MAX_P);

  vl ts;
  ts.push_back(-1);
  for (int i = 0; i + 1 < pn; i++)
    if (pnums[i] + 2 == pnums[i + 1])
      ts.push_back((ll)pnums[i] * pnums[i + 1]);
  //printf(" ts=%d\n", (int)ts.size());
  
  int tn;
  scanf("%d", &tn);

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

    auto vit = upper_bound(ts.begin(), ts.end(), n) - 1;
    printf("%lld\n", *vit);
  }

  return 0;
}