def eratosthenes(n):
    primes = [True] * (n+1)
    primes[0], primes[1] = False, False
    for i in range(2, int(n**0.5)+1):
        if primes[i]:
            for j in range(i*i, n+1, i):
                primes[j] = False

    return [p for p in range(2, n+1) if primes[p]]

t = int(input())
for _ in range(t):
    n = int(input())
    if n < 15:
        print(-1)
        continue
        
    primes_list = list(eratosthenes(n))

    ok, ng = 0, len(primes_list)
    while abs(ok - ng) > 1:
        mid = (ok + ng) // 2
        p = primes_list[mid]
        if p * (p + 2) <= n:
            ok = mid
        else:
            ng = mid

    print(primes_list[ok] * (primes_list[ok] + 2))