def prime_numbers():
    res = []
    is_prime = [True] * 100001
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(10000 ** 0.5) + 1):
        if is_prime[i]:
            res.append(i)
            for j in range(2 * i, 100001, i):
                is_prime[j] = False
    return res

def prime_factors(N):
    res = []
    for i in primes:
        while N % i == 0:
            res.append(i)
            N //= i
        if N == 1: break
    if N != 1: res.append(N)
    return res

Q = int(input())
A = [int(input()) for _ in range(Q)]
primes = prime_numbers()

for i in range(Q):
    pf = prime_factors(A[i])
    if len(pf) == 3:
        print("Yes")
    else:
        print("No")