C.cpp

/*
 © 2021-01-28 08:35:01 Franco1010 All Rights Reserved
*/

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
void solve(){
  lli n; cin >> n;
  vi comp;
  fore(i, 0, 2 * n){
    lli x; cin >> x;
    comp.pb(x);
  }
  sort(all(comp));
  comp.erase(unique(all(comp)), end(comp));
  // for(auto i : comp) cout << i << ' '; cout << ENDL;
  if(sz(comp) != n){
    cout << "NO" << ENDL;
    return;
  }
  else{
    reverse(all(comp));
    lli acu = 0;
    fore(i, 0, n){
      lli foo = 2ll * lli(n - i);
      lli bar = comp[i] - acu;
      if(bar % foo != 0 or bar <= 0){
        cout << "NO" << ENDL;
        return;
      }
      acu += 2ll * bar / foo;
    }
    cout << "YES" << ENDL;
  }
}
int main(){ _
  // freopen("file.in","r",stdin);
  // freopen("file.out","w",stdout);
  lli t; cin >> t;
  while(t--){
    solve();
  }
  return 0;
}