#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
#define lson rt << 1, l, m
#define rson rt << 1 | 1, m + 1, r
using namespace std;
const int INF = 0x7FFFFFFF;
const int MOD = 1000000000 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int maxn = 10000 + 66;
int dp[maxn], ans[maxn];
int main()
{
// ifstream cin("aaa.txt");
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int tot = 0;
for (int i = 0; i < n; i++)
{
cin >> ans[i];
tot += ans[i];
}
if (tot & 1)
{
cout << "No" << endl;
continue;
}
memset (dp, 0, sizeof (dp));
tot /= 2;
for (int i = 0; i < n; i++)
{
for (int j = tot; j >= ans[i]; j--)
dp[j] = max (dp[j], dp[j-ans[i]] + ans[i]);
}
if (dp[tot] != tot)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
}