from collections import defaultdict
from math import gcd, isqrt


def sieve(n: int):
    """エラトステネスの篩（O(n log log n)）"""
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, isqrt(n) + 1):
        if is_prime[i]:
            for j in range(i * i, n + 1, i):
                is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]


primes = sieve(10**6)


def weak_factorize(n: int) -> defaultdict[int, int]:
    factors = defaultdict(int)
    for p in primes:
        if p * p > n:
            break
        while n % p == 0:
            factors[p] += 1
            n //= p
    if n > 1:
        factors[n] += 1
    return factors


Q = int(input())

for _ in range(Q):
    N = int(input())
    factors = weak_factorize(N)
    print(gcd(*factors.values()))