#include <bits/stdc++.h>
#define ll long long
#define pp push_back
#define ff first
#define ss second

using namespace std;

ll w,m,mm,h,r,l,ii,i1,jj,x[1000001],y[1000001],z,g,aa,bb,a,b,c,d,vis[1000001],k,kk,mod=1e9+7,q,inf=1e18;
ll T,i,j,n;
vector <pair <ll,ll> > v,vv;
pair <ll,ll> p[1000001];
map <ll,ll> mp,mpp,mppp;
multiset <ll> se,see;
multiset <ll> :: iterator it,itt,it1;
string s,s2,s1;
char cc;

int main()
{
    ios::sync_with_stdio(0);
    cin >> T;
    while(T--)
    {
        cin >> n;
        for(i=0;i<2*n;i++)
            cin >> x[i];
        sort(x,x+2*n);
        a=0;
        b=0;
        j=0;
        for(i=n*2-1;i>0;i-=2)
        {
            if(x[i]!=x[i-1] || (x[i]-a)%((n-j)*2)!=0 || x[i]-a<=0 || x[i]==x[i-2])
            {
                b=1;
                break;
            }
            x[i]-=a;
            a+=x[i]/((n-j));
            j++;
        }
        if(b==0)
            cout << "YES";
        else
            cout << "NO";
        cout << endl;
    }
    return 0;
}
