#include <bits/stdc++.h>
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
#define maxn 3e5+10

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD=1e9+7;
const int INF32=1<<30;
const ll INF64=1LL<<60;

void solve(){
    int t;cin >> t;
    while(t--){
       ll n;cin >> n;
       vector<ll>a(2*n),b(2*n,0);
       map<ll,ll>mp;
       for(int i = 0;i<2*n;i++) cin >> a[i];
       sort(a.begin(),a.end());
       bool ok = 1;
       for(int i = 2;i<2*n;i+=2){
           ll diff = a[i]-a[i-1];
           if(diff%i) {ok = 0;break;}
           b[i] += b[i-2]+diff/i;
       }
       ll sum = 0;
       for(int i = 0;i<2*n;i=i+2) sum += 2*b[i];//watch(b[i]);
       //for(int i = 0;i<2*n;i++) cout << b[i] <<' ';
      // cout <<endl;
       if(sum>=a[0]) ok = 0;
       else if((sum-a[0])%(2*n)) ok = 0;
       for(int i = 0;i<2*n;i++){
          mp[a[i]]++;
          if(mp[a[i]]>2)ok = 0;
       }
       for(auto i:mp){
        if(i.second!=2)ok = 0;
       }
       if(ok) cout <<"YES"<<'\n';
       else cout <<"NO"<<'\n';
    }
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  solve();
  return 0;
}

