#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define pll pair<ll,ll>
#define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
#define forD(i,a,n,x) for(ll i=n-1;i>=a;i-=x)
#define ranit(it,n) for(auto it:n)
#define testCases ll t;cin>>t;while(t--)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define init(a,x) memset(a,x,sizeof(a))

int main()
{
	ios_base::sync_with_stdio(false);	cin.tie(NULL);	cout.tie(NULL);
	testCases
	{
		ll n; cin>>n;
		vll v(2*n); forA(i,0,2*n,1)cin>>v[i];

		sort(v.rbegin(), v.rend());

		//ranit(it,v)cout<<it<<" ";cout<<"\n";

		bool ch=true;
		ll temp=0,p=2*n,past=LLONG_MAX-1;

		forA(i,0,2*n,2)
		{
			if(v[i]!=v[i+1])
			{
				ch=false;
				break;
			}
			else
			{
				if((v[i]-temp)%p==0)
				{
					ll tt = (v[i]-temp)/p;
					if(tt>=past || tt<=0)
					{
						ch=false;
						break;
					}
					past=tt;
					//cout<<tt<<" ";

					temp+=(2*tt);
				}
				else
				{
					ch=false;
					break;
				}
			}
			p-=2;
		}

		if(ch)cout<<"YES\n";
		else cout<<"NO\n";

	}
	return 0;
}