#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define frfr  freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout)
#define ll long long int
#define wh int T;cin >> T;while(T--)
#define foro(i,n) for(int i=0;i<n;i++)

void solve(){
	ll n;
	cin >> n;
	ll arr[2*n];
	set<ll> s;
	unordered_map<int,int> m;
	foro(i,2*n){
		cin >> arr[i];
		s.insert(arr[i]);
		m[arr[i]]++;
	}
	for(int i=0;i<n;++i){
	  if(m[arr[i]]%2 != 0){
		  cout << "NO" << endl;
		  return ;
	  }	
	}
	bool flag = false;
	if(s.size() != n){
		cout << "NO" << endl;
		return ;
	}
	vector<ll> v;
	for(ll i:s){
		v.push_back(i);
	}
	ll sum = 0;
	for(ll i=n-1;i>=0;i--){
		v[i] -=  sum;
		if(v[i] > 0 && v[i]%(2*(i+1)) == 0 ){
			sum += 2*(v[i]/(2*(i+1))); 
		}else{
			cout << "NO" << endl;
			return;
		}
	}
	cout << "YES" << endl;
	
}
int main()
{
    IOS;
    // frfr;
    wh{
        solve();
    }
    return 0;
}
