#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

long long gcd(long long n, long long m)
{
    if(m == 0)
    {
        return n;
    }
    return gcd(m, n % m);
}

std::vector<int> enum_prime(int n) // containing n
{
    std::vector<int> res;
    if (n <= 1)
    {
        return res;
    }
    std::vector<bool> p(n + 1);
    fill(p.begin() + 2, p.end(), true);
    for (int i = 2; i <= n; i++)
    {
        if (p[i])
        {
            res.push_back(i);
            for (int j = i * 2; j <= n; j += i)
            {
                p[j] = false;
            }
        }
    }
    return res;
}

int main()
{
    vector<int> prime = enum_prime(1000000);
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        bool b[1000005]{0};
        ll a[1005];
        for(int i = 0; i < n; i++)
        {
            cin >> a[i];
            for(int p : prime)
            {
                while(a[i] % (p * p) == 0)
                {
                    a[i] /= p * p;
                }
                if(a[i] % p == 0)
                {
                    a[i] /= p;
                    b[p] ^= 1;
                }
            }
        }
        for(int i = 0; i < n; i++)
        {
            for(int j = i + 1; j < n; j++)
            {
                ll g = gcd(a[i], a[j]);
                a[i] /= g;
                a[j] /= g;
            }
        }
        bool f = false;
        for(int p : prime)
        {
            f |= b[p];
        }
        for(int i = 0; i < n; i++)
        {
            f |= (a[i] > 1);
        }
        cout << (!f ? "Yes" : "No") << endl;
    }
}