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.io.*;
  import java.util.*;
  
  public class tank {
  
      static final FastScanner fs = new FastScanner();
  
      //static PrintWriter out = new PrintWriter(System.out);
  
      public static void main(String[] args) {
          int t = fs.nextInt();
          while(t-- > 0) {
              run_case();
          }
  
          //out.close();
      }
  
      static void run_case() {
          int n = fs.nextInt();
          int[] arr = fs.readArray(n);
  
          int[] mask = new int[n];
          mask[0] = 1;
  
          int mx = 1, sum, carry, ind;
  
          for (int i = 1; i <= n; i++) {
              mx *= 3;
          }
  
          for (int i = 0; i < mx - 1; i++) {
              sum = 0;
              for (int j = 0; j < n; j++) {
                  if(mask[j] == 0) continue;
  
                  if(mask[j] == 1) sum += arr[j];
                  else sum -= arr[j];
              }
  
  //            for(int j: mask) System.out.print(j + " ");
  //            System.out.println();
  
              if(sum == 0) {
                  System.out.println("YES");
                  return;
              }
  
              carry = 1;
              ind = 0;
  
              while(carry > 0) {
                  mask[ind] += carry;
  
                  if(mask[ind] > 2) {
                      carry = mask[ind] - 2;
                      mask[ind] = (mask[ind]) % 3;
                  }else {
                      carry = 0;
                  }
  
                  ind++;
                  if(ind == n) break;
              }
          }
  
          System.out.println("NO");
      }
  
      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();
          }
  
          String nextLine(){
              try {
                  return br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
  
              return "";
          }
  
          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());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  }