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 codeforce.globalround.y2021.r15;
  
  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.Collections;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  import java.util.stream.Collectors;
  import java.util.stream.IntStream;
  import java.util.ArrayList;
  import java.util.List;
  import java.util.HashMap;
  import java.util.Map;
  import java.util.Set;
  import java.util.HashSet;
  
  import static java.lang.System.out;
  import static java.util.stream.Collectors.joining;
  
  
  /**
   * @author pribic (Priyank Doshi)
   * @see <a href="https://codeforces.com/contest/1552/problem/D" target="_top">https://codeforces.com/contest/1552/problem/D</a>
   * @since 25/07/21 9:12 PM
   */
  public class D {
    static FastScanner sc = new FastScanner(System.in);
  
    public static void main(String[] args) {
      try (PrintWriter out = new PrintWriter(System.out)) {
        int T = sc.nextInt();
        for (int tt = 1; tt <= T; tt++) {
          int n = sc.nextInt();
          int[] arr = new int[n];
          boolean valid = false;
          for (int i = 0; i < n; i++) {
            arr[i] = Math.abs(sc.nextInt());
          }
          Set<Integer> subsets = new HashSet<>();
          for (int i = 0; i < (1 << n); i++) {
            int sum = 0;
            for (int j = 0; j < n; j++) {
              if (((i >> j) & 1) == 1) {
                sum += arr[j];
              }
            }
            if (subsets.contains(sum)) {
              //System.out.println("yes subset sum " + i);
              valid = true;
              break;
            }
            subsets.add(sum);
          }
  
          System.out.println(valid ? "YES" : "NO");
        }
      }
    }
    
    /*
    n*n pairs -> we just need n pairs out of n*n which equals a given number in array
    
  diff 5 7 12 10
  
  orig 20 27 15
  
  diff  1 3 7 -4 
  
  orig  -2 3 1 5  
    
    
    -3 2 10 2
     a1 a2 a3 a4
     
     a1 = b1/10 - b1/10 -> n * n -> 100 * 100
     a2 =                        -> 100 ^ 10 -> 1e12
     
     b1    b1 - a1
     
     0 
      
     */
  
    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), 32768);
      }
  
      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());
      }
    }
  }