#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for (int i=a; i<b; ++i)
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector <ll> d(2*n);
        for (auto &x: d) cin >> x;
        sort(d.begin(), d.end());
        vector <ll> distinct(n);
        bool exists = true;
        for (int i=0; i<2*n; i+=2)
        {
            if (d[i]!=d[i+1]) {
                exists=false;
                break;
            }
            distinct[i/2]=d[i];
        }
        if (!exists) {cout << "NO\n"; continue;}
        ll coeff = 2*n;
        ll pfxsum = 0;
        set <ll> S;
        for (int i=n-1; i>=0; --i)
        {
            // cout << distinct[i] << " " << pfxsum << " " << coeff << "\n";
            if (((distinct[i] - pfxsum) > 0) && ((distinct[i] - pfxsum)%coeff)==0)
            {
                ll val = (distinct[i] - pfxsum)/coeff;
                if (val<=0) {exists=false; break;}
                if (S.empty() || ((*S.begin()) > val))
                {
                    pfxsum += 2*val; 
                    coeff -= 2;
                    S.insert(val);
                }
                else {exists=false; break;}
            }
            else { exists=false;break;}
        }
        if (!exists) {cout << "NO\n"; continue;}
        cout << "YES\n";
    }
    return 0;
}
