is_prime = [True] * int(2e7)
is_prime[0] = is_prime[1] = False
for i in range(2, int(int(2e7)**0.5) + 1):
    if is_prime[i]:
        for j in range(i * i, int(2e7), i):
            is_prime[j] = False

ok = [-1]
for i in range(int(2e7)-2):
    if is_prime[i] and is_prime[i+2]:
        ok.append(i*(i+2))

from bisect import bisect_right

T = int(input())

for _ in range(T):
    print(ok[bisect_right(ok, int(input())) - 1])