import sys
input = lambda : sys.stdin.readline().rstrip()

sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))

def hurui(n):
    """線形篩
    pl: 素数のリスト
    mpf: iを割り切る最小の素因数
    """
    pl = []
    mpf = [None]*(n+1)
    for d in range(2,n+1):
        if mpf[d] is None:
            mpf[d] = d
            pl.append(d)
        for p in pl:
            if p*d>n or p>mpf[d]:
                break
            mpf[p*d] = p
    return pl, mpf
from collections import defaultdict
def factor(num):
    d = defaultdict(int)
    if num==1:
        d.update({1:1})
        return d
    while num>1:
        d[mpf[num]] += 1
        num //= mpf[num]
    return d
def fs(num):
    f = factor(num)
    ans = [1]
    for k,v in f.items():
        tmp = []
        for i in range(len(ans)):
            val = 1
            for _ in range(v):
                val *= k
                ans.append(ans[i]*val)
    return ans
def sub(x,p):
    res = 0
    while x%p==0:
        x //= p
        res += 1
    return res
inf = 10**15
from heapq import heappop as hpp, heappush as hp, heapify
def dijkstra(start,d):
    n = len(d)
    vals = [inf] * n
    h = [(0, start)] # (距離, ノード番号)
    vals[start] = 0
    # order = []
    while h:
        val, u = hpp(h)
        if val>vals[u]:
            continue
        # order.append(u)
        for v in range(u+1,n):
            dd = d[u][v]
#         for d,v in ns[u]:
            if vals[v]>val+dd:
                vals[v] = val+dd
                hp(h, (vals[v], v))
    return vals #, order

pl, mpf = hurui(10**6)
t = int(input())
ans = []
for i in range(t):
    x = int(input())
    for p in pl:
        if x%p!=0:
            res = p
            break
    else:
        assert 0
    m = 10
    count = [-1]*m # 回数がiの素数の最小
    for i in range(50)[::-1]:
        v = sub(x,pl[i])
        if v<m:
            count[v] = pl[i]
    inf = 10**9
    d = [[inf]*m for _ in range(m)]
    for i in range(m):
        v = count[i]
        if v==-1:
            continue
        cost = v
        for j in range(i+1,m):
            d[i][j] = cost
            cost *= v
    n = m
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j], d[i][k]+d[k][j])
    for i in range(m):
        if 2*i+1<m:
            res = min(res, d[i][2*i+1])
    ans.append(res*x)
write("\n".join(map(str, ans)))