# 素因数分解し、使っていない素因数を加えるか、または、2**2などを加える、どれが一番小さいか

from collections import defaultdict
 
# 辞書型に改造
def factorization(n):
    arr = defaultdict(int)
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr[i] = cnt
    if temp!=1:
        arr[temp] = 1
    if arr==[]:
        arr[n] = 1
    return arr
    
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,37]

T = int(input())
for t in range(T):
    X = int(input())
    factors = factorization(X)
    #print(factors)
    
    candidates = []
    for p in primes:
        if p in factors:
            candidates.append(pow(p, factors[p]+1))
        else:
            candidates.append(p)
    ans = min(candidates)*X
    print(ans)
    
    #print(candidates)