#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PI 3.14159265358979323846
#define _INF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
#define MOD 100000007
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define pb push_back
#define JUDGE(x) cout << (x ? "Yes" : "No") << endl
#define Rep(n) for(ll i = 1; i <= n; i++)
#define IN(L, R, A) for (ll i = L; i <= R; i++) cin >> A[i];
#define CF ll Tx; cin >> Tx; while (Tx--)
typedef long long ll;
typedef unsigned int Uint;
typedef unsigned long long Ull;
using namespace std;
const int N = 2e5 + 5;
inline int read(){
    int x = 0, f = 1; char ch = getchar();
    while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
    while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
    return x * f;
}

ll arr[N];

bool cmp (ll a, ll b) {return a > b;}

int main() {
    fast;
    CF {
        ll n; cin >> n;
        for (int i = 0; i < 2 * n; i++) cin >> arr[i];
        sort (arr, arr + 2 * n, cmp);
        bool flag = false; ll now = 0;
        for (int i = 0; i < n; i++) {
            if (i > 0 && arr[2 * i] == arr[2 * (i - 1)]) {
                flag = true; break;
            }
            else if (arr[i * 2] == arr[i * 2 + 1]) {
                if (arr[i * 2] - now > 0 && (arr[i * 2] - now) % (2 * (n - i)) == 0)
                    now += (arr[i * 2] - now) / (n - i);
                else {
                    flag = true; break;
                }
            }
            else {
                flag = true; break;
            }
        }
        if (flag) NO; else YES;
    }
}
					 	 		  		   	  	   		 	 		