#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline void amin(T &x, const T &y) {
  if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
  if (x < y) x = y;
}
template <class T>
void sort_unique(vector<T> &v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
int N;
int X[1 << 10];
int A[10];
void MAIN() {
  scanf("%d", &N);
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    int x;
    scanf("%d", &x);
    A[i] = abs(x);
  }
  bool yes = false;
  for (int s = 1; s < (1 << N); s++) {
    int k = __builtin_ctz(s);
    X[s] = X[s ^ (1 << k)] + A[k];
  }
  sort(X, X + (1 << N));
  for (int i = 0, i_len = ((1 << N) - 1); i < i_len; ++i) {
    if (X[i] == X[i + 1]) yes = true;
  }
  puts(yes ? "YES" : "NO");
}
int main() {
  int TC = 1;
  scanf("%d", &TC);
  for (int tc = 0, tc_len = (TC); tc < tc_len; ++tc) MAIN();
  return 0;
}
