#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        long long int n;
        cin>>n;
        long long int a[2*n];
        for(int i=0;i<2*n;i++) cin>>a[i];
        long long int tag=true,x=0;
        unordered_map<long long int,long long int>mp;
        sort(a,a+2*n);
        for(int i=n*2-1;i>0;i--)
        {
            if(a[i]!=a[i-1]) {tag=false;break;}
            long long int k=a[i]-2*x;
            if(k<=0||k%(i+1)!=0){ tag=false;break;}
            x+=k/(i+1);
            if(mp[k/(i+1)]==1){tag=false; break;}
            mp[k/(i+1)]=1;
            i--;
        }
        if(tag==true) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}