#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897923846;
const long long int MOD = 1000000007;
const long long int N = 998244353;
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
long long int modinverse(long long int a) { return power(a, MOD - 2); }
long long int n;
vector<long long int> a;
bool dfs(long long int index, long long int sum, bool used) {
  if (used && sum == 0) return true;
  if (index == n) return false;
  bool nas = false;
  nas = (nas || dfs(index + 1, sum, used));
  nas = (nas || dfs(index + 1, a[index] + sum, true));
  nas = (nas || dfs(index + 1, -a[index] + sum, true));
  return nas;
}
void solve() {
  cin >> n;
  a.clear();
  a.resize(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (dfs(0, 0, false))
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
