import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

def pf(a):
    res = [0]*len(prime)
    for i, p in enumerate(prime):
        e = 0
        while a%p == 0:
            a //= p
            e += 1
        res[i] = e
    return res

def cnt_fac(cc):
    res = 1
    for c in cc: res *= c+1
    return res

prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]
dd = [None]*32

for a in range(2, 32): dd[a] = pf(a)

def solve():
    def ok(a):
        cc = cc0[:]
        for i, c in enumerate(dd[a]): cc[i] += c
        return cnt_fac(cc) == s*2

    x = II()
    cc0 = pf(x)
    s = cnt_fac(cc0)
    for a in range(2, 32):
        if ok(a):
            print(x*a)
            return

for _ in range(II()):
    solve()