#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#define int long long
#include <stack>
using namespace std;

int t,n;

int gcd(int a,int b){
	return b > 0 ? gcd(b,a % b) : a;
}

int lcm(int a,int b){
	return a * b / gcd(a,b);
}

signed main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>t;
	int a[10011];
	for(int x = 1;x <= t;x++){
		cin>>n;
		
		int tt = -1e9;
		int maxn = -1e9;
		bool falg = true;
		for(int i = 1;i <= n;i++){
			cin>>a[i];
			//tt *= a[i];
			tt = max(a[i],maxn);
		}
		//cout<<tt<<endl;
		//tt = a[1];
		//cout<<tt<<endl;
		for(int i = 1;i <= n;i++){
			if(tt % a[i] != 0){
				falg = false;
				break;
			}
		}
		if(falg){
			cout<<"Yes"<<endl;;
		}else{
			cout<<"No"<<endl;
		}
	}
	return 0;
}