#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long MOD = 1000000007;
const long double PI = 3.141592653589793238;
const long long pi = 31415926;
const long long inf = 1000000000000000000;
const long long small_inf = INT_MAX;
const int N = 300002;
int power(int x, int n) {
  int res = 1;
  while (n > 0) {
    if (n & 1) res = res * x;
    x = x * x;
    n >>= 1;
  }
  return res;
}
int add(int x, int y) { return (x + y) % MOD; }
int mult(int x, int y) { return (x * y) % MOD; }
void init() {}
void solve() {
  int n;
  cin >> n;
  std::vector<int> v(n, 0);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  for (int i = 0; i < power(2, n); i++) {
    std::vector<int> v1;
    if (i == 0) continue;
    for (int j = 0; j < n; j++) {
      if ((i & (1 << j))) v1.push_back(v[j]);
    }
    {
      int n = v1.size();
      for (int i = 0; i < power(2, n); i++) {
        int x = 0;
        for (int j = 0; j < n; j++) {
          if (i & (1 << j)) {
            x += v1[j];
          } else
            x -= v1[j];
        }
        if (x == 0) {
          cout << "YES" << endl;
          return;
        }
      }
    }
  }
  cout << "NO\n";
}
void clear_global() {}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int t23 = 1, tt23 = 1;
  cin >> t23;
  init();
  while (tt23 <= t23) {
    solve();
    tt23++;
    clear_global();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
