#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
    int t;
    ll n, d[200007], i;
    scanf("%d", &t);
    while(t--){
        scanf("%lld", &n);
		for (i = 1; i <= n*2; i++){
			scanf("%lld", &d[i]);
		}
		sort(d+1, d+1+n*2);
		ll s = 0;
		int f = 1;
		ll last = -1;
		for (i = n*2 - 2; i > 0; i -= 2){
			if (d[i] == d[i+1]){
				f = 0;
			}
		}
		for (i = n*2; i > 0 && f; i -= 2){
			if (d[i] != d[i-1]) {
				f = 0;
				break;
			}
			if ((d[i] - s) % i || d[i] - s <= 0 || last == ((d[i] - s) / i)){
				f = 0;
				break;
			}
			last = (d[i] - s) / i;
			s += (d[i] - s) / i * 2;
		}
		if (f){
			printf("YES\n");
		}else{
			printf("NO\n");
		}
    }
    return 0;
}
