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 org.w3c.dom.ls.LSOutput;
  
  import java.io.*;
  import java.util.*;
  public class Main {
  
      static long mod = 1000000007;
  
      public static long power(long a, long b){
          if(b == 0)
              return 1;
          long A = power(a,b/2);
          long B = ((A*A)%(mod)*((long)Math.pow(a,b%2)))%mod;
          return B;
      }
  
      static int gcd(int a, int b)
      {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
      public static void main(String[] args) throws IOException {
          Reader.init(System.in);
          int times = Reader.nextInt();
          for (int time = 0; time < times; time++) {
              int n = Reader.nextInt();
              Vector<Integer> arr = new Vector<>();
              for (int i = 0; i < n; i++) {
                  arr.add(Reader.nextInt());
              }
              Vector<Integer> ans = new Vector<>();
              if(is(0,arr,0,0)) System.out.println("YES");
              else System.out.println("NO");
          }
      }
  
      static boolean is(int i, Vector<Integer> arr, int s, int points){
          if(s == 0 && points > 0) return true;
          if(i == arr.size()) return false;
          return is(i+1,arr,s + arr.get(i),points+1) || is(i+1,arr,s - arr.get(i),points+1) || is(i+1,arr,s,points);
      }
  
      static boolean com(int[] i, int[] j){
          int count = 0;
          for (int k = 0; k < 5; k++) {
              if(i[k] < j[k]) count++;
              else count--;
          }
          return count > 0;
      }
  
  }
  
  class Reader {
      static BufferedReader reader;
      static StringTokenizer tokenizer;
  
      static void init(InputStream input) {
          reader = new BufferedReader(
                  new InputStreamReader(input) );
          tokenizer = new StringTokenizer("");
      }
  
      static String next() throws IOException {
          while ( ! tokenizer.hasMoreTokens() ) {
              tokenizer = new StringTokenizer(
                      reader.readLine() );
          }
          return tokenizer.nextToken();
      }
  
      static int nextInt() throws IOException {
          return Integer.parseInt( next() );
      }
  
      static double nextDouble() throws IOException {
          return Double.parseDouble( next() );
      }
      static long nextLong() throws IOException {
          return Long.parseLong( next() );
      }
      static Float nextFloat() throws IOException {
          return Float.parseFloat( next() );
      }
  }