# include <bits/stdc++.h>
# define mod 1e9+7 
# define ll long long
# define ld long double 
using namespace std; 


void solve(){
	ll n;
	cin >> n;
	
	ll arr[2*n], b[n];
	
	for (ll i=0; i<2*n; i++){
		cin >> arr[i];
	}
	
	sort (arr, arr + 2*n);
	
	for (ll i=0; i<2*n-1; i+=2){
		if (arr[i] != arr[i+1]){
			cout << "NO" << endl;
			return;
		}
		b[i/2] = arr[i];
	}
//	cout << "hi " << endl;
//	for (ll i=0; i<n; i++){
//		cout << b[i] << endl;
//	}
	ll symm[n];
	ll sum = 0;
	set <ll> s;
	
	for (ll i=n-1; i>=0; i--){
	//	cout << "hi ";
		if ((b[i] - 2*sum) % (2*(i+1)) != 0){
			cout << "NO" << endl;
			return;
		} 
		symm[i] = (b[i] - 2*sum) / (2*(i+1));
		
		if (symm[i] <= 0 or s.count(symm[i]) != 0){
			cout << "NO" << endl;
			return;
		}
		sum += symm[i];
		s.insert(symm[i]);
		//cout << symm[i] << " ";
	}
	cout << "YES" << endl;
	return;
	
}


int main(){
	int t;
	//std::cout << std::fixed;
	//std::cout << std::setprecision(50) << ans;
	cin >> t;
//	t = 1;

	while (t--){
		solve();
	}
}




