#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int inf = 0x3f3f3f3f;
const long long linf = 1234567890123456789;
const long long mod = 998244353;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    int poss = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < (1 << n); j++) {
        if (j & (1 << i)) continue;
        for (int k = 0; k < (1 << n); k++) {
          if ((j & k) != k) continue;
          int sum = 0;
          for (int l = 0; l < n; l++) {
            if (j & (1 << l)) {
              if (k & (1 << l)) {
                sum -= a[l];
              } else {
                sum += a[l];
              }
            }
          }
          if (sum == a[i]) poss = 1;
        }
      }
    }
    cout << (poss ? "YES" : "NO") << "\n";
  }
}
