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.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define arrinit \
    int n;      \
    cin >> n;   \
    int arr[n]; \
    loop(i, n) { cin >> arr[i]; }
#define warrinit(n) \
    int arr[n];     \
    loop(i, n) { cin >> arr[i]; }
#define init(arr, n, val)       \
    for (int i = 0; i < n; i++) \
        arr[i] = val;
#define ret return
#define cont continue
#define endl "\n"
#define ll long long

#define loops(i, s, n) for (int i = s; i < n; i++)
#define loop(i, n) for (int i = 0; i < n; i++)
#define loopr(i, s, e) for (int i = s; i >= e; i--)
#define loopitr(mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)

#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define pub push_back
#define pob pop_back
#define vpii vector<pair<int, int>>
#define vall(v) v.begin(), v.end()
#define mkp make_pair
#define ff first
#define ss second

#define print(arr)        \
    for (auto x : arr)    \
        cout << x << " "; \
    cout << endl;
#define cnt_bits __builtin_popcountll
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define eps 1e-7
const int mod = 1000000007;
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define hello cout << "hello" << endl

int main()
{
    fastio;
    int t;
    cin >> t;

    loop(T, t)
    {
        arrinit;
        set<int> st;
        unordered_map<int, int> mp;
        bool cond = false;
        loop(i, n)
        {
            mp[arr[i]]++;
            if (mp[arr[i]] > 1)
            { // duplicate exists
                cond = true;
            }
        }

        if (mp[0] > 0)
            cond = true; // zero exists

        loop(i, n)
        {
            loops(j, i + 1, n)
            {
                st.insert(arr[i] - arr[j]);
                st.insert(arr[j] - arr[i]);
            }
        }

        loop(i, n)
        {
            if (st.find(arr[i]) != st.end())
            { // an element exists as diff of two elems
                cond = true;
                break;
            }
        }
        
        if (n > 3)
        { // because we would need zero for this
            loop(i, n)
            {
                loops(j, i + 1, n)
                {
                    if (st.find(arr[i] + arr[j]) != st.end())
                    { // sum of two elems equal to diff of two elems
                        cond = true;
                        break;
                    }
                }
            }
        }

        if (cond)
            YES;
        else
            NO;
    }
}