def prime_factors(N):
    res = []
    for i in range(2, int(N ** 0.5) + 1):
        while N % i == 0:
            res.append(i)
            N //= i
    if N != 1: res.append(N)
    return res

Q = int(input())
for _ in range(Q):
    A = int(input())
    pf = prime_factors(A)
    if len(pf) == 3:
        print("Yes")
    else:
        print("No")