#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n;
long long a[N];
void solve(){
	cin>>n;
	for(int i=1;i<=n*2;++i){
		cin>>a[i];
	}
	sort(a+1,a+1+n*2);
	for(int i=1;i<=n*2;i+=2){
		if(a[i+1]!=a[i]){
			cout<<"NO\n";
			return ;
		}
	}
	long long res=0;
	if(n>1){
		for(int i=1;i<=2*n-2;i+=2){
			if(a[i]==a[i+2]){
				cout<<"NO\n";
				return;
			}
			if((a[i+2]-a[i])%(i+1)!=0){
				cout<<"NO\n";
				return;
			}
			else{
				
				res+=(a[i+2]-a[i])/(i+1);
			}
		}
	}
	if(a[n*2]%(2*n)==0&&a[n*2]/(2*n)>res)
		cout<<"YES\n";
	else{
		cout<<"NO\n";
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int Case;
	cin>>Case;
	while(Case--){
		solve();
	}
}