#include <bits/stdc++.h>
using namespace std;
const int maxn = 10 + 5;
int a[maxn];
set<int> all;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> a[i];
    all.clear();
    all.insert(0);
    bool solve = false;
    for (int i = 0; i < n; ++i) {
      if (all.find(a[i]) != all.end() || all.find(-a[i]) != all.end())
        solve = true;
      set<int> temp;
      for (int v : all) {
        temp.insert(v + a[i]);
        temp.insert(v - a[i]);
      }
      for (int v : temp) all.insert(v);
    }
    if (solve)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
