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

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

def solve():
    x0 = x = II()
    mn = inf

    to = [[] for _ in range(11)]
    for p in prime:
        e = 1
        while x%p == 0:
            x //= p
            e += 1
        if e == 1:
            mn = p
            break
        c = p
        v = e+1
        while c < 31 and e < 11:
            to[e].append((v, c))
            c *= p
            v += 1

    for s in range(2, 6):
        dist = [inf]*11
        dist[s] = 1
        for u in range(min(s*2, 11)):
            for v, c in to[u]:
                nd = dist[u]*c
                dist[v] = min(dist[v], nd)
        mn = min(mn, dist[s*2])
    print(x0*mn)

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