"""

6 = 2 * 3
24 = 2*2*2*6

2*2

2->4

"""

from sys import stdin
import sys
from collections import deque

def Sieve(n): #n以下の素数全列挙(O(nloglogn)) retは素数が入ってる。divlisはその数字の素因数が一つ入ってる

    ret = []
    divlis = [-1] * (n+1) #何で割ったかのリスト(初期値は-1)
    
    flag = [True] * (n+1)
    flag[0] = False
    flag[1] = False

    ind = 2
    while ind <= n:

        if flag[ind]:
            ret.append(ind)

            ind2 = ind ** 2

            while ind2 <= n:
                flag[ind2] = False
                divlis[ind2] = ind
                ind2 += ind

        ind += 1

    return ret,divlis

plis,tmp = Sieve(1000000)

tt = int(stdin.readline())

for loop in range(tt):

    X = int(stdin.readline())

    ans = float("inf")
    for p in plis:
        if ans < X * p:
            break

        divnum = 0
        TX = X
        while TX % p == 0:
            divnum += 1
            TX //= p

        mlp = divnum + 1
        #print (p,mlp)
        ans = min(ans , X * (p**mlp))
        #print (p,X * (p**mlp))

    print (ans)