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: //package com.company.cf.global15;
  
  import java.io.BufferedReader;
  import java.io.File;
  import java.io.FileNotFoundException;
  import java.io.FileReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.Arrays;
  import java.util.StringTokenizer;
  import java.util.stream.IntStream;
  
  public class D {
      FastScanner in;
      PrintWriter out;
  
      private final int[][] r = new int[50001][5];
  
      public static void main(String[] args) {
          new D().solve();
      }
  
      private void solve() {
          in = new FastScanner(System.in);
          out = new PrintWriter(System.out);
  
          int t = in.nextInt();
          for (int i = 0; i < t; i++) {
              out.println(solveCase());
  //            out.flush();
          }
  
          out.close();
      }
  
      private String solveCase() {
          int n = in.nextInt();
  
          int[] a = new int[n];
          for (int i = 0; i < n; i++) {
              a[i] = Math.abs(in.nextInt());
          }
  
          Arrays.sort(a);
  
          if (a[0] == 0) return "YES";
  
          for (int s1 = 1; s1 < (1 << n); s1++) {
              for (int s2 = 1; s2 < (1 << n); s2++) {
                  if ((s1 & s2) == 0) {
                      if (sum(a, s1) == sum(a, s2)) return "YES";
                  }
              }
          }
          return "NO";
      }
  
      private int sum(int[] a, int mask) {
          int res = 0;
          for (int i = 0; i < a.length; i++) {
              if ((mask & (1 << i)) != 0) {
                  res += a[i];
              }
          }
          return res;
      }
  
      static class FastScanner {
  
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner(File f) {
              try {
                  br = new BufferedReader(new FileReader(f));
              } catch (FileNotFoundException e) {
                  e.printStackTrace();
              }
          }
  
          public FastScanner(InputStream f) {
              br = new BufferedReader(new InputStreamReader(f));
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return null;
                  st = new StringTokenizer(s);
              }
              return st.nextToken();
          }
  
          boolean hasMoreTokens() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return false;
                  st = new StringTokenizer(s);
              }
              return true;
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  
  }
  