#include <bits/stdc++.h>   using namespace std;   const long long int mod = 1e9 + 7;   const double pie = 3.14159265358979323846;   const char nl =   n ;   template <typename Type>   istream &operator>>(istream &in, vector<Type> &v) {     long long int n = v.size();     for (int i = 0; i < n; i++) in >> v[i];     return in;   }   template <typename Type>   ostream &operator<<(ostream &out, vector<Type> &v) {     for (auto value : v) out << value <<    ;     out << endl;     return out;   }   void solve() {     long long int n;     cin >> n;     vector<long long int> a(4 * n);     cin >> a;     sort(a.begin(), a.end());     long long int area = a[0] * a.back();     long long int c = 1, j = 4 * n - 1;     for (long long int i = 0; c <= n;) {       if (a[i] != a[i + 1] or a[j] != a[j - 1] or a[i] * a[j] != area) {         cout <<  No n ;         return;       }       ++c;       i += 2;       j -= 2;     }     cout <<  Yes n ;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long int t;     cin >> t;     while (t--) {       solve();     }     return 0;   }   