#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> Pii;
typedef pair <ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int N = (int)(2e5) + 7;

int _, n;
ll d[N], a[N];
bool check() {
    sort(d + 1, d + 1 + 2 * n);
    int len = 0;
    for (int i = 2; i <= 2 * n; i += 2) {
        if (d[i] != d[i - 1]) return false;
        d[++len] = d[i];
    }
    for (int i = 2; i <= n; ++i) {
        if (d[i] == d[i - 1]) return false;
    }
    for (int i = 1; i <= n; ++i) {
        if (d[i] % 2) return false;
        d[i] /= 2;
    }
    ll sum = d[1];
    for (int i = 1; i <= n; ++i) d[i] -= sum;
    a[1] = 0;
    for (int i = 2; i <= n; ++i) {
        a[i] = d[i] - d[i - 1];
        if (a[i] % (i - 1)) return false;
        a[i] /= (i - 1);
    }
    ll cur = 0;
    for (int i = 2; i <= n; ++i) a[i] += a[i - 1], cur += a[i];
    return sum > cur && (sum - cur) % n == 0;
}

int main() {

    // freopen("in.in", "r", stdin);
    for (scanf("%d", &_); _; --_) {
        scanf("%d", &n);
        for (int i = 1; i <= 2 * n; ++i) scanf("%lld", &d[i]);
        puts(check() ? "YES" : "NO");
    }

    return 0;
}