#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long mod = 1000000007;
const long long INF18 = 1000000000000000000;
long long n;
long long a[1010];
bool ok = false;
void rec(long long depth, long long cnt, long long sum) {
  if (ok) return;
  if (depth >= n) {
    if (cnt < 1) return;
    if (sum == 0) ok = true;
    return;
  }
  rec(depth + 1, cnt, sum);
  rec(depth + 1, cnt + 1, sum + a[depth]);
  rec(depth + 1, cnt + 1, sum - a[depth]);
}
void solve() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0; i < n; i++) {
    if (a[i] == 0) {
      cout << "YES\n";
      return;
    }
    for (long long j = 0; j < n; j++) {
      if (i == j) continue;
      if (a[i] == a[j]) {
        cout << "YES\n";
        return;
      }
    }
  }
  ok = false;
  rec(0, 0, 0);
  if (ok)
    cout << "YES\n";
  else
    cout << "NO\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
}
