#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;

int main()
{
    ll t, n;
    cin >> t;
    for (int i = 0; i < t; i++){
        cin >> n;
        vector<ll> a(n);
        for (int j = 0; j < n; j++) cin >> a[j];
        while (a.size() >= 3){
            sort(a.begin(), a.end(), greater());
            a[0] -= a[2];
            a[1] -= a[2];
            a.erase(a.begin() + 2);
            if (a[1] == 0) a.erase(a.begin() + 1);
            if (a[0] == 0) a.erase(a.begin() + 0);
        }
        cout << ((a.size() == 0) ? "Yes" : "No") << endl;
    }
}