require "prime"
primes = Prime.each(10**6).to_a

T = gets.to_i
T.times do
    x = gets.to_i
    y = x * primes.find { |p| x % p != 0 }
    if (p = primes.find { |p| x % p == 0 })
        n = 0
        _x = x
        while _x % p == 0
            n += 1
            _x /= p
        end
        if n.odd?
            y2 = x * p**(n + 1)
            y = y2 if y > y2
        end
    end
    puts y
end