mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    def PrimeDecomposition(N):
        ret = {}
        n = int(N ** 0.5)
        for d in range(2, n + 1):
            while N % d == 0:
                if d not in ret:
                    ret[d] = 1
                else:
                    ret[d] += 1
                N //= d
            if N == 1:
                break
        if N != 1:
            ret[N] = 1
        return ret

    D = [None for _ in range(101)]
    for i in range(1, 101):
        D[i] = PrimeDecomposition(i)

    for _ in range(int(input())):
        X = int(input())
        for i in range(2, 101):
            P = D[i]
            upper = lower = 1
            for p in P:
                d = P[p]
                e = 0
                XX = X
                while XX % p == 0:
                    e += 1
                    XX //= p
                upper *= d + e + 1
                lower *= e + 1
            if upper == lower * 2:
                print(i * X)
                break


if __name__ == '__main__':
    main()