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.
import java.io.*;
import java.util.*;

public class Solution {
    static FastScanner fs;
    static PrintWriter pw;

    public static void main(String[] args) {
        fs = new FastScanner();
        pw = new PrintWriter(System.out);
        int t = fs.nextInt();
        while (t-- > 0)
            solve();
        pw.close();
    }

    public static void solve() {
        int n = fs.nextInt();
        int[] a = fs.readArray(n);
        for (int i=0; i<n; i++) {
            HashSet<Integer> prev = new HashSet<>();
            prev.add(0);
            for (int j=0; j<n; j++) {
                if (i==j)
                    continue;
                HashSet<Integer> curr = new HashSet<>();
                for (int last : prev) {
                    curr.add(last);
                    curr.add(last+a[j]);
                    curr.add(last-a[j]);
                }
                prev = curr;
            }
            if (prev.contains(a[i])) {
                pw.println("YES");
                return;
            }
        }
        pw.println("NO");
        return;
    }

    static long pow(long b, long exp, long mod) {
        long ret = 1;
        while (exp > 0) {
            if ((exp & 1) > 0)
                ret = (ret * b) % mod;
            b = (b * b) % mod;
            exp >>= 1;
        }
        return ret;
    }

    static int nCrmod(int n, int r, int mod) {
        if (r > n)
            return 0;
        if (n - r > r)
            r = n - r;
        int[] SPF = new int[n + 1];
        for (int i = 1; i <= n; i++)
            SPF[i] = i;
        for (int i = 4; i <= n; i += 2)
            SPF[i] = 2;
        for (int i = 3; i * i < n + 1; i += 2) {
            if (SPF[i] == i) {
                for (int j = i * i; j < n + 1; j += i)
                    if (SPF[j] == j) {
                        SPF[j] = i;
                    }
            }
        }
        Map<Integer, Integer> prime_pow = new HashMap<>();
        for (int i = r + 1; i < n + 1; i++) {
            int t = i;
            while (t > 1) {
                prime_pow.put(SPF[t],
                        prime_pow.getOrDefault(SPF[t], 0) + 1);
                t /= SPF[t];
            }
        }
        for (int i = 1; i < n - r + 1; i++) {
            int t = i;
            while (t > 1) {
                prime_pow.put(SPF[t], prime_pow.get(SPF[t]) - 1);
                t /= SPF[t];
            }
        }
        long ans = 1;
        for (int i : prime_pow.keySet())
            ans = (ans * pow(i, prime_pow.get(i), mod)) % mod;
        return (int) ans;
    }

    //    static int k;
//    static int par(int curr) {
//        return (1<<k)-1-(((1<<k)-1-curr)/2);
//    }
//    static int left(int curr) {
//        return (1<<k)-1-(2*((1<<k)-1-curr)+1);
//    }
//    static int right(int curr) {
//        return (1<<k)-1-(2*((1<<k)-1-curr));
//    }
    static int gcd(int a, int b) {
        if (a == 0) return b;
        return gcd(b % a, a);
    }

    static void ruffleSort(int[] a) {
        int n = a.length;//shuffle, then sort
        for (int i = 0; i < n; i++) {
            int oi = random.nextInt(n), temp = a[oi];
            a[oi] = a[i];
            a[i] = temp;
        }
        Arrays.sort(a);
    }

    static final Random random = new Random();

    static class FastScanner {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }

    static int[] reverse(int[] a) {
        int n = a.length;
        int[] res = new int[n];
        for (int i = 0; i < n; i++) res[i] = a[n - 1 - i];
        return res;
    }
}