#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const int M = 1e9;
const int N = 5e4 + 10;
int a[20];
void init() { return; }
bool check() {}
void solve() {
  int n;
  scanf("%d", &n);
  int sum = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    sum *= 3;
  }
  bool flag = false;
  for (int i = 1; i < sum; i++) {
    int part = i, now = 0;
    for (int j = 1; j <= n; j++) {
      if (part % 3 == 1) {
        now += a[j];
      } else if (part % 3 == 2) {
        now -= a[j];
      }
      part /= 3;
    }
    if (now == 0) {
      flag = true;
      break;
    }
  }
  if (flag) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
  return;
}
int main() {
  int num;
  scanf("%d", &num);
  while (num--) {
    solve();
  }
  return 0;
}
