using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var p = new List<int>();
        for (var i = 2; i < 100000; ++i)
        {
            if (IsPrime(i)) p.Add(i);
        }
        var q = NN;
        var ans = new bool[q];
        for (var i = 0; i < q; ++i)
        {
            var a = long.Parse(ReadLine());
            var x = 0;
            while (x < p.Count)
            {
                if (a % p[x] == 0) break;
                ++x;
            }
            if (x == p.Count) continue;
            var y = x;
            while (y < p.Count)
            {
                if (a / p[x] % p[y] == 0) break;
                ++y;
            }
            if (y == p.Count) continue;
            var z = a / p[x] / p[y];
            if (IsPrime(z)) ans[i] = true;
        }
        WriteLine(string.Join("\n", ans.Select(f => f ? "Yes" : "No")));
    }
    static bool IsPrime(long n)
    {
        if (n == 1) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;
        int i = 3;
        while (i * i <= n)
        {
            if (n % i == 0) return false;
            i = i + 2;
        }
        return true;
    }
}