#include <bits/stdc++.h>
using namespace std;
#define _ << ' ' <<
#define int int64_t
#define all(x) begin(x), end(x)
#define sz(x) int(x.size())

void task() {
  int n;
  cin >> n;
  vector<int> d(2 * n);
  for (int i = 0; i < 2 * n; ++i) {
    cin >> d[i];
  }
  sort(all(d));
  reverse(all(d));
  int sum = 0;
  for (int i = 0; i < n; ++i) {
    if (d[2 * i] != d[2 * i + 1]) {
      cout << "NO\n";
      return;
    }
    if (i < n - 1 && d[2 * i] == d[2 * i + 2]) {
      cout << "NO\n";
      return;
    }
    if ((d[2 * i] - 2 * sum) % (2 * (n - i)) != 0) {
      cout << "NO\n";
      return;
    }
    if ((d[2 * i] - 2 * sum) / (2 * (n - i)) <= 0) {
      cout << "NO\n";
      return;
    }
    // cout << (d[2 * i] - 2 * sum) / (2 * (n - i)) << '\n';
    sum += (d[2 * i] - 2 * sum) / (2 * (n - i));
  }
  cout << "YES\n";
}

int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tc = 1;
  cin >> tc;
  while (tc--) {
    task();
  }
}
