from collections import Counter
import math
def prime_numbers(x):
    if x < 2:
        return []
    prime_numbers = [i for i in range(x)]
    prime_numbers[1] = 0
    for prime_number in prime_numbers:
        if prime_number > math.sqrt(x):
            break
        if prime_number == 0:
            continue
        for composite_number in range(2 * prime_number, x, prime_number):
            prime_numbers[composite_number] = 0
    return [prime_number for prime_number in prime_numbers if prime_number != 0]
primes = prime_numbers(10 ** 6)
def soinnsuu(x):
    s = []
    for i in primes:
        if i > int(math.sqrt(x)):
            break
        elif x % i == 0:
            while x % i == 0:
                x //= i
                s.append(i)
    if not x == 1:
        s.append(x)
    return s
for _ in range(int(input())):
    x = int(input())
    d = Counter(soinnsuu(x))
    ans = 10 ** 20
    for p, c in d.items():
        ans = min(ans, pow(p, c + 1), 10 ** 20)
    for p in primes:
        if not p in d:
            ans = min(ans, p)
            break
    print(ans * x)