func_code_string: #include <bits/stdc++.h>   using namespace std;   long long t[3000000];   long long t1[3000000];   long long dp[10 * 10 + 5][10 + 5];   vector<long long> v;   long long n, m, k, l, r, nb, q, p;   map<long long, int> mapp;   void debug(long long* tab, int len) {     cout <<  debug ::::  n ;     for (int i = 0; i < len; i++) cout << tab[i] <<    ;     cout <<   n ;   }   int main() {     ios_base::sync_with_stdio(0);     cin >> nb;     while (nb--) {       cin >> n;       for (int i = 0; i < 4 * n; i++) cin >> t[i];       sort(t, t + 4 * n);       bool test = true;       for (int i = 0; i < 2 * n; i++) {         if (t[2 * i + 1] != t[2 * i]) test = false;       }       for (int i = 0; i < 2 * n; i++) t1[i] = t[2 * i];       long long k = t1[0] * t1[2 * n - 1];       for (int i = 0; i < n; i++) {         if (t1[i] * t1[2 * n - 1 - i] != k) test = false;       }       if (test)         cout <<  YES ;       else         cout <<  NO ;       if (nb) cout <<   n ;     }   }   