#include<bits/stdc++.h>   using namespace std;   #define ll long long   #define ull unsigned long long   #define f(i,x,y) for(int i=x;i<=y;i++)   #define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);   //priority_queue<int>Q;   //unordered_map<string,int> Q;   const int MAX=3e5+10;   ll a[MAX];   void solve() {    ll n;    cin>>n;    for(int i=1; i<=n*2; i++) {     cin>>a[i];    }    int flag1=1;    sort(a+1,a+1+n*2,greater<ll>());    ll last;    int v=-1;    ll flag=0;    ll cnt=n;    for(int i=1; i<=n*2; i+=2) {     if(a[i]!=a[i+1]||a[i]<2||a[i]%2) {      flag1=0;      cout<< NO <<endl;      break;     }     a[i]-=flag;     if((v!=-1&&a[i]>=last*cnt)||a[i]<=0) {      flag1=0;      cout<< NO <<endl;      break;     }     if(a[i]%cnt==0) {      v=1;      last=a[i]/cnt;     } else {      flag1=0;      cout<< NO <<endl;      break;     }     if(last&1)     {      flag1=0;      cout<< NO <<endl;         break;     }     flag+=last;     cnt--;    }    if(flag1)     cout<< YES <<endl;   }   int main() {    IOS;    int t;    cin>>t;    while(t--) {     solve();    }   }   