#include<bits/stdc++.h>
using namespace std;
int main(){
int t,n,k[100001],flag=0;
cin>>t;
while(t--){
	cin>>n;
	for(int j=1;j<=n;j++){
		cin>>k[j];
	    int maxk=max(k[j],maxk);
		if(maxk%k[j]==0) flag++;
	}
	if(flag==n) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	}
	return 0;
}