Prime = [True for _ in range(10**6 + 1)]
Prime[0] = Prime[1] = False
for i in range(2, 10**6 + 1):
    if Prime[i]:
        for j in range(i + i, 10**6 + 1, i):
            Prime[j] = False
Prime_set = set()
for i in range(2, 10**6 + 1):
    if Prime[i]:
        Prime_set.add(i)
Prime = sorted(Prime_set)

t = int(input())
for _ in range(t):
    x = int(input())
    if x % 2 == 1:
        print(2 * x)
    elif x == 2:
        print(6)
    else:
        xc = x
        pow2 = 2
        while xc % 2 == 0:
            pow2 *= 2
            xc //= 2
        min_prime = 10**18
        prime_idx = 1
        while prime_idx < len(Prime) and Prime[prime_idx] <= x:
            prime = Prime[prime_idx]
            if prime > pow2:
                break
            if xc % prime != 0:
                min_prime = min(min_prime, prime)
                prime_idx += 1
                continue
            tmp = prime
            while xc % prime == 0:
                xc //= prime
                tmp *= prime
            min_prime = min(min_prime, tmp)
            prime_idx += 1
        print(x * min(pow2, min_prime))