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.util.Scanner;
import java.util.stream.IntStream;

public class D {
    public static void main(String[] args) {
        Scanner scn = new Scanner(System.in);
        int test = scn.nextInt();
        while (test-- > 0) {
            int nr = scn.nextInt();
            int[] arr = new int[nr];
            for (int i = 0; i < nr; i++) {
                arr[i] = scn.nextInt();
                if (arr[i] < 0) arr[i] = -arr[i];
            }
            int totalSum = IntStream.of(arr).sum();
            boolean[][] dp = new boolean[nr][totalSum + 1];
            for (int index = 0; index < nr; index++) {
                for (int sum = 0; sum <= totalSum; sum++) {
                    boolean ans;
                    if (sum == 0) {
                        ans = true;
                    } else {
                        if (index == 0) {
                            ans = sum == arr[index];
                        } else {
                            if (sum - arr[index] < 0) {
                                ans = dp[index - 1][sum];
                            } else {
                                ans = dp[index - 1][sum] || dp[index - 1][sum - arr[index]];
                            }
                        }
                    }
                    dp[index][sum] = ans;
                }
            }
            int count = 1;
            for (int sum = 1; sum <= totalSum; sum++) {
                if (dp[nr - 1][sum]) {
                    count++;
                }
            }
            if (count == 1 << nr) {
                System.out.println("NO");
            } else {
                System.out.println("YES");
            }
        }

    }
}
