#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[1000005];
int gcd(int a,int b){
	return (b==0)?a:gcd(b,a%b);
}
signed main(){
	int t;
	cin>>t;
	for(int i=1;i<=t;i++){
		int n;
		cin>>n;
		for(int j=1;j<=n;j++){
			cin>>a[i];
		}
		sort(a+1,a+n+1);
		bool flag=false;
		for(int j=n;j>=3;j--){
			if(gcd(a[j],a[j-1])==a[j-2]){
				continue;
			} 
			else {
				cout<<"No"<<endl;
				flag=true;
				break;
			}
		}
		if(!flag){
			cout<<"Yes"<<endl;
		}
	}
	return 0;
}