#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
//#define mod 1000000007
using namespace std;

typedef  long long LL;
typedef pair<int, int>PII;
inline LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
const int N = 200010;

int n;
LL a[N];

bool cmp(LL a, LL b) {
	return a > b;
}

void solve() {
	bool flag = true;
	cin >> n;

	map<LL, LL, greater<LL>>mp;

	for (int i = 1; i <= 2 * n; ++i) {
		cin >> a[i];
		mp[a[i]]++;
	}
	LL las = LLONG_MAX;
	LL sum = 0;
	for (auto &t : mp) {
		//cout << "t.first == " << t.first << endl;
		if (t.second != 2) {
			flag = false;
			break;
		}
		else if (t.first & 1) {
			flag = false;
			break;
		}
		else {
			if (((t.first - sum) / 2) % n) {
				flag = false;
				break;
			}

			LL x = (t.first - sum)/ 2 / n;
			//cout << "x == " << x << endl;
			if (x <= 0 || x >= las) {
				flag = false;
				break;
			}
			n--;
			sum += 2 * x;
			las = x;
		}
	}
	if (flag)puts("YES");
	else puts("NO");
}
/*
* if (las != 0 && las < x) {
				flag = false;
				break;
			}
*/
int main() {
	int t; cin >> t;
	while (t--)
		solve();

	return 0;
}

