def f(x, p):
    res = 0
    while x % p == 0:
        x //= p
        res += 1

    return res


def solve():
    X = int(input())

    if X == 1:
        return 2

    ps = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
    res = INF
    for p in ps:
        if X % p != 0:
            res = min(res, X * p)
            break

    for p in ps:
        cnt = f(X, p)
        if cnt == 0: continue
        x = X // pow(p, cnt) * pow(p, cnt+cnt+1)
        res = min(res, x)

    return res


INF = 1 << 60
T = int(input())
for _ in range(T):
    ans = solve()
    print(ans)