tc=int(input())
for i in range(tc):
n=int(input())
x=False
l=[int(i) for i in input().split()]
l1=sorted(l)
k=min(l)
for i in range(n):
if l[i]==l1[i]: continue
elif l[i]%k==0 and l1[i]%k==0: continue
else:
x=True
break
if x==True: print("NO")
else: print("YES")#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int n;
cin>>n;
int arr[n];
int temp[n];
for(int i=0;i<n;i++){
cin>>arr[i];
temp[i]=arr[i];
}
sort(temp,temp+n);
int small=temp[0];
vector<int>v;
for(int i=0;i<n;i++){
if(arr[i]!=temp[i])
v.push_back(arr[i]);
}
int check=1;
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
if(v[i]%small!=0){
check=0;
break;
}
}
if(check) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}1635D - Infinite Set | 1462A - Favorite Sequence |
1445B - Elimination | 1656C - Make Equal With Mod |
567A - Lineland Mail | 1553A - Digits Sum |
1359B - New Theatre Square | 766A - Mahmoud and Longest Uncommon Subsequence |
701B - Cells Not Under Attack | 702A - Maximum Increase |
1656D - K-good | 1426A - Floor Number |
876A - Trip For Meal | 1326B - Maximums |
1635C - Differential Sorting | 961A - Tetris |
1635B - Avoid Local Maximums | 20A - BerOS file system |
1637A - Sorting Parts | 509A - Maximum in Table |
1647C - Madoka and Childish Pranks | 689B - Mike and Shortcuts |
379B - New Year Present | 1498A - GCD Sum |
1277C - As Simple as One and Two | 1301A - Three Strings |
460A - Vasya and Socks | 1624C - Division by Two and Permutation |
1288A - Deadline | 1617A - Forbidden Subsequence |