description: 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.
solution: import java.lang.*;
  import java.util.*;
  import java.io.*;
  import java.math.*;
  
  public class Main {
      static void deal(int n,int[] arr) {
          HashSet<Integer> hs = new HashSet<>();
          int max = (int)Math.pow(3,n);
          int[] sum = new int[max];
          hs.add(0);
          for(int i=1;i<max;i++) {
              int s = 0;
              int num = i;
              int index = 0;
              while(num>0) {
                  int d = num % 3;
                  num = num /3;
                  if(d==1) {
                      s+=arr[index];
                  } else if(d==2) {
                      s-=arr[index];
                  }
                  index++;
              }
              sum[i] = s;
              if(s==0) {
                  out.println("YES");
                  return;
              }
              hs.add(sum[i]);
          }
          out.println("NO");
      }
  
      static int lowbit(int i) {
          return i & (-i);
      }
  
  	public static void main(String[] args) {
          MyScanner sc = new MyScanner();
          out = new PrintWriter(new BufferedOutputStream(System.out));
          int t = sc.nextInt();
          for(int i=0;i<t;i++) {
              int n = sc.nextInt();
              int[] arr = new int[n];
              for(int j=0;j<n;j++) {
                  arr[j] = sc.nextInt();
              }
              deal(n,arr);
          }
          out.close();
      }
      
      //-----------PrintWriter for faster output---------------------------------
      public static PrintWriter out;
      
      //-----------MyScanner class for faster input----------
      public static class MyScanner {
          BufferedReader br;
          StringTokenizer st;
          
          public MyScanner() {
                  br = new BufferedReader(new InputStreamReader(System.in));
          }
          
          String next() {
                  while (st == null || !st.hasMoreElements()) {
                          try {
                                  st = new StringTokenizer(br.readLine());
                          } catch (IOException e) {
                                  e.printStackTrace();
                          }
                  }
                  return st.nextToken();
          }
          
          int nextInt() {
                  return Integer.parseInt(next());
          }
          
          long nextLong() {
                  return Long.parseLong(next());
          }
          
          double nextDouble() {
                  return Double.parseDouble(next());
          }
          
          String nextLine(){
                  String str = "";
      try {
              str = br.readLine();
      } catch (IOException e) {
              e.printStackTrace();
      }
      return str;
          }
          
      }
  }