#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void _print(int x) { cerr << x; }
void _print(float x) { cerr << x; }
void _print(string x) { cerr << x; }
void _print(ll x) { cerr << x; }
void _print(char x) { cerr << x; }
void _print(bool x) { cerr << x; }
template <class T, class V>
void _print(pair<T, V> x) {
  cerr << "[";
  _print(x.first);
  cerr << " ";
  _print(x.second);
  cerr << "]";
}
template <class T>
void _print(vector<T> x) {
  cerr << "[ ";
  for (int i = 1; i < x.size() + 1; ++i) {
    cerr << "(" << i - 1 << ")";
    _print(x[i - 1]);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> x) {
  cerr << "[ ";
  for (T i : x) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> x) {
  cerr << "[ ";
  for (T i : x) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(priority_queue<T, vector<T>, greater<T>> x) {
  cerr << "[ ";
  while (!x.empty()) {
    _print(x.top());
    cerr << " ";
    x.pop();
  }
  cerr << "]";
}
template <class T>
void _print(priority_queue<T> x) {
  cerr << "[ ";
  while (!x.empty()) {
    _print(x.top());
    cerr << " ";
    x.pop();
  }
  cerr << "]";
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
  for (auto& i : v) os << i << ' ';
  return os;
}
template <typename T, typename U>
istream& operator>>(istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U> p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <typename T, typename U>
istream& operator>>(istream& is, vector<pair<T, U>>& p) {
  for (auto& i : p) {
    is >> i.first >> i.second;
  }
  return is;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, vector<pair<T, U>>& p) {
  for (auto& i : p) {
    os << i.first << " " << i.second << endl;
  }
  return os;
}
template <typename T>
pair<T, bool> getNthElement(set<T>& searchSet, int index) {
  pair<T, bool> result;
  if (searchSet.size() > index) {
    result.first = *(std::next(searchSet.begin(), index));
    result.second = true;
  } else
    result.second = false;
  return result;
}
template <typename T>
istream& operator>>(istream& is, set<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> v) {
  for (auto& i : v) os << i << ' ';
  return os;
}
const ll mod = 1e9 + 7;
const int N = 5e4 + 20;
template <typename T, typename U>
ll modMul(T a, U b) {
  return ((a % mod) * 1LL * (b % mod)) % mod;
}
template <typename T, typename U>
ll binpower(T n, U k) {
  T res = 1;
  while (k) {
    if (k & 1) {
      res = modMul(res, n);
    }
    n = modMul(n, n);
    k >>= 1;
  }
  return res % mod;
}
template <typename T>
T moduloInverse(T a) {
  return binpower(a, mod - 2);
}
template <typename T, typename U>
ll modAdd(T a, U b) {
  return ((a % mod) + (b % mod)) % mod;
}
template <typename T, typename U>
ll modSub(T a, U b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
template <typename T, typename U>
ll modDiv(T a, U b) {
  return modMul(a, moduloInverse(b));
}
void precision(int a) { cout << setprecision(a) << fixed; }
void solve() {
  int n;
  cin >> n;
  vector<int> A(n);
  cin >> A;
  int k = binpower(3, n);
  for (int i = 1; i < k; ++i) {
    int a = i;
    int sum = 0;
    for (int j = 0; j < n; ++j) {
      int d = a % 3;
      if (d == 1) sum += A[j];
      if (d == 2) sum -= A[j];
      a /= 3;
    }
    if (sum == 0) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
void initialise() { return; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  initialise();
  for (int i = 1; i < t + 1; ++i) {
    solve();
  }
  return 0;
}

### Prompt

Create a solution in CPP for the following problem:

You are given a sequence of n integers a_1,   a_2,   ...,   a_n.

Does there exist a sequence of n integers b_1,   b_2,   ...,   b_n such that the following property holds?

  * For each 1 ≤ i ≤ n, there exist two (not necessarily distinct) indices j and k (1 ≤ j,   k ≤ n) such that a_i = b_j - b_k. 

Input

The first line contains a single integer t (1 ≤ t ≤ 20) — the number of test cases. Then t test cases follow.

The first line of each test case contains one integer n (1 ≤ n ≤ 10).

The second line of each test case contains the n integers a_1,   ...,   a_n (-10^5 ≤ a_i ≤ 10^5).

Output

For each test case, output a line containing YES if a sequence b_1,   ...,   b_n satisfying the required property exists, and NO otherwise.

Example

Input


5
5
4 -7 -1 5 10
1
0
3
1 10 100
4
-3 2 10 2
9
25 -171 250 174 152 242 100 -205 -258


Output


YES
YES
NO
YES
YES

Note

In the first test case, the sequence b = [-9,   2,   1,   3,   -2] satisfies the property. Indeed, the following holds: 

  * a_1 = 4 = 2 - (-2) = b_2 - b_5; 
  * a_2 = -7 = -9 - (-2) = b_1 - b_5; 
  * a_3 = -1 = 1 - 2 = b_3 - b_2; 
  * a_4 = 5 = 3 - (-2) = b_4 - b_5; 
  * a_5 = 10 = 1 - (-9) = b_3 - b_1. 



In the second test case, it is sufficient to choose b = [0], since a_1 = 0 = 0 - 0 = b_1 - b_1.

In the third test case, it is possible to show that no sequence b of length 3 satisfies the property.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void _print(int x) { cerr << x; }
void _print(float x) { cerr << x; }
void _print(string x) { cerr << x; }
void _print(ll x) { cerr << x; }
void _print(char x) { cerr << x; }
void _print(bool x) { cerr << x; }
template <class T, class V>
void _print(pair<T, V> x) {
  cerr << "[";
  _print(x.first);
  cerr << " ";
  _print(x.second);
  cerr << "]";
}
template <class T>
void _print(vector<T> x) {
  cerr << "[ ";
  for (int i = 1; i < x.size() + 1; ++i) {
    cerr << "(" << i - 1 << ")";
    _print(x[i - 1]);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> x) {
  cerr << "[ ";
  for (T i : x) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> x) {
  cerr << "[ ";
  for (T i : x) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(priority_queue<T, vector<T>, greater<T>> x) {
  cerr << "[ ";
  while (!x.empty()) {
    _print(x.top());
    cerr << " ";
    x.pop();
  }
  cerr << "]";
}
template <class T>
void _print(priority_queue<T> x) {
  cerr << "[ ";
  while (!x.empty()) {
    _print(x.top());
    cerr << " ";
    x.pop();
  }
  cerr << "]";
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
  for (auto& i : v) os << i << ' ';
  return os;
}
template <typename T, typename U>
istream& operator>>(istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U> p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <typename T, typename U>
istream& operator>>(istream& is, vector<pair<T, U>>& p) {
  for (auto& i : p) {
    is >> i.first >> i.second;
  }
  return is;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, vector<pair<T, U>>& p) {
  for (auto& i : p) {
    os << i.first << " " << i.second << endl;
  }
  return os;
}
template <typename T>
pair<T, bool> getNthElement(set<T>& searchSet, int index) {
  pair<T, bool> result;
  if (searchSet.size() > index) {
    result.first = *(std::next(searchSet.begin(), index));
    result.second = true;
  } else
    result.second = false;
  return result;
}
template <typename T>
istream& operator>>(istream& is, set<T>& v) {
  for (auto& i : v) is >> i;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> v) {
  for (auto& i : v) os << i << ' ';
  return os;
}
const ll mod = 1e9 + 7;
const int N = 5e4 + 20;
template <typename T, typename U>
ll modMul(T a, U b) {
  return ((a % mod) * 1LL * (b % mod)) % mod;
}
template <typename T, typename U>
ll binpower(T n, U k) {
  T res = 1;
  while (k) {
    if (k & 1) {
      res = modMul(res, n);
    }
    n = modMul(n, n);
    k >>= 1;
  }
  return res % mod;
}
template <typename T>
T moduloInverse(T a) {
  return binpower(a, mod - 2);
}
template <typename T, typename U>
ll modAdd(T a, U b) {
  return ((a % mod) + (b % mod)) % mod;
}
template <typename T, typename U>
ll modSub(T a, U b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
template <typename T, typename U>
ll modDiv(T a, U b) {
  return modMul(a, moduloInverse(b));
}
void precision(int a) { cout << setprecision(a) << fixed; }
void solve() {
  int n;
  cin >> n;
  vector<int> A(n);
  cin >> A;
  int k = binpower(3, n);
  for (int i = 1; i < k; ++i) {
    int a = i;
    int sum = 0;
    for (int j = 0; j < n; ++j) {
      int d = a % 3;
      if (d == 1) sum += A[j];
      if (d == 2) sum -= A[j];
      a /= 3;
    }
    if (sum == 0) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
void initialise() { return; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  initialise();
  for (int i = 1; i < t + 1; ++i) {
    solve();
  }
  return 0;
}

```