#include <bits/stdc++.h>
// !-------------PBDS-----------------!
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,std::greater_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// !-------------PBDS-----------------! remember about greater/_equal<int>, less/_equal<int>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

template<typename T>
std::ostream& print(std::ostream &out, T const &val) { return (out << val << " "); }

template<typename T1, typename T2>
std::ostream& print(std::ostream &out, std::pair<T1, T2> const &val) { return (out << "{" << val.first << " " << val.second << "} "); }

template<template<typename, typename...> class TT, typename... Args>
std::ostream& operator<<(std::ostream &out, TT<Args...> const &cont) {
    cout << "{";
    for(auto elem : cont) print(out, elem);
    cout << "}";
    return out;
}

#define IOS         ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pcont(x)    for(auto i: x){cout << i << " ";} cout << "\n";
#define all(x)      (x).begin(), (x).end()
#define rall(x)     (x).rbegin(), (x).rend()
#define debug(x)    cerr << "[" << #x << ": " << x << "]" << endl;

void solve(){
    ll n;
    cin >> n;
    set<ll> s;
    map<ll, ll> m;
    for(ll i = 0; i<2*n; i++){
        ll x;
        cin >> x;
        m[x]++;
        s.insert(x);
    }
    for(auto p:m){
        if(p.second != 2){
            cout << "NO\n";
            return;
        }
    }
    auto ptr = s.end();
    --ptr;
    ll val = *ptr;
    // debug(val);
    if((ll)s.size() != n || val%(2*n) != 0){
        cout << "NO\n";
        return;
    }
    vector<ll> d;
    for(ll i:s)d.push_back(i);
    vector<ll> values(n);
    ll sub = 0;
    // debug(d);
    for(ll i = 1; i<=n; i++){
        ll div = 2*(n-i+1);
        if(i != 1)sub += values[n-i+1];
        ll left = d[n-i]-2*sub;
        // debug(div);
        // debug(sub);
        // debug(left);
        if(left <= 0 || left%div != 0){
            cout << "NO\n";
            return;
        }
        values[n-i] = left/div;
        // debug(values);
    }
    cout << "YES\n";
}

int main(){
    IOS;
    int tc = 1;
    cin >> tc;
    while(tc--){
        solve();
    }
    return 0;
}