#include<bits/stdc++.h>
int prime[10010],pcnt;
bool book[10010];
int t,n;
int a[500010];
bool is_prime(int x)
{
	for(int i=2;i*i<=x;i++)
	{
		if(x%i==0) return false;
	}
	return true;
}
void pre_prime()
{
	for(int i=2;i<=10000;i++)
	{
		if(is_prime(i))
		{
			prime[pcnt]=i;
			pcnt++;
		}
	}
}
using namespace std;
int main()
{
	cin>>t;
	pre_prime();
	for(int i=0;i<t;i++)
	{
		cin>>n;
		
		memset(a,0,sizeof(a));
		memset(book,0,sizeof(book));
		bool out=0;
		for(int j=0;j<n;j++)
		{
			cin>>a[j];
			if(n!=2)
			{
				for(int k=0;k<pcnt;k++)
				{
					if(a[j]%prime[k]==0)
					{
						if(book[k]&&!out)
						{
							cout<<"No\n";
							out=1;
							break;
						}
						else
						{
							book[k]=1;
						}
					}
				}
				if(out) continue;
			}
		}
		if(n==2)
		{
			cout<<"Yes\n";
			continue;
		}
		if(!out) cout<<"Yes\n";
	}
	return 0;
}