N=int(input())
def m(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
  
for i in range(N):
  d=int(input())
  cnta=len(m(d))
  for j in range(2,10001):
    cntb=len(m(j*d))
    if cnta*2==cntb:
      print(d*j)
      break