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.util.*;
  import java.io.*;
  import java.text.*;
  
  public class CF_1552_D{
      //SOLUTION BEGIN
      void pre() throws Exception{}
      void solve(int TC) throws Exception{
          int N = ni();
          int[] A = new int[N];
          for(int i = 0; i< N; i++)A[i] = Math.abs(ni());
  
          boolean yes = false;
          for(int i = 0; i< N; i++) {
              yes |= A[i] == 0;
              for (int j = 0; j < i; j++)
                  if (A[i] == A[j]) yes = true;
          }
          for(int mask = 1; mask < 1<<N; mask++){
              int B = bit(mask);
              if(B > 1 && B < N){
                  int[] list = new int[B];
                  int[] rem = new int[N-B];
                  for(int i = 0, j = 0, k = 0; i< N; i++)
                      if(((mask>>i)&1)==1)
                          list[j++] = A[i];
                      else rem[k++] = A[i];
                  for(int sign = 0; sign < 1<<(B-1); sign++){
                      int sum = list[0];
                      for(int i = 0; i< B-1; i++){
                          if(((sign>>i)&1)==1)sum -= list[i+1];
                          else sum += list[i+1];
                      }
                      for(int x:rem)if(Math.abs(sum) == x)yes = true;
                  }
              }
          }
          pn(yes?"YES":"NO");
      }
      //SOLUTION END
      void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
      void exit(boolean b){if(!b)System.exit(0);}
      static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}
      final long IINF = (long)1e17;
      final int INF = (int)1e9+2;
      DecimalFormat df = new DecimalFormat("0.00000000000");
      double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-8;
      static boolean multipleTC = true, memory = true, fileIO = false;
      FastReader in;PrintWriter out;
      void run() throws Exception{
          long ct = System.currentTimeMillis();
          if (fileIO) {
              in = new FastReader("");
              out = new PrintWriter("");
          } else {
              in = new FastReader();
              out = new PrintWriter(System.out);
          }
          //Solution Credits: Taranpreet Singh
          int T = multipleTC? ni():1;
          pre();
          for (int t = 1; t <= T; t++) solve(t);
          out.flush();
          out.close();
          System.err.println(System.currentTimeMillis() - ct);
      }
      public static void main(String[] args) throws Exception{
          if(memory)new Thread(null, new Runnable() {public void run(){try{new CF_1552_D().run();}catch(Exception e){e.printStackTrace();System.exit(1);}}}, "1", 1 << 28).start();
          else new CF_1552_D().run();
      }
      int[][] make(int n, int e, int[] from, int[] to, boolean f){
          int[][] g = new int[n][];int[]cnt = new int[n];
          for(int i = 0; i< e; i++){
              cnt[from[i]]++;
              if(f)cnt[to[i]]++;
          }
          for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
          for(int i = 0; i< e; i++){
              g[from[i]][--cnt[from[i]]] = to[i];
              if(f)g[to[i]][--cnt[to[i]]] = from[i];
          }
          return g;
      }
      int[][][] makeS(int n, int e, int[] from, int[] to, boolean f){
          int[][][] g = new int[n][][];int[]cnt = new int[n];
          for(int i = 0; i< e; i++){
              cnt[from[i]]++;
              if(f)cnt[to[i]]++;
          }
          for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];
          for(int i = 0; i< e; i++){
              g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};
              if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};
          }
          return g;
      }
      int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}
      int digit(long s){int ans = 0;while(s>0){s/=10;ans++;}return ans;}
      long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
      int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
      int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
      void p(Object... o){for(Object oo:o)out.print(oo+" ");}
      void pn(Object... o){for(int i = 0; i< o.length; i++)out.print(o[i]+(i+1 < o.length?" ":"\n"));}
      void pni(Object... o){for(Object oo:o)out.print(oo+" ");out.println();out.flush();}
      String n()throws Exception{return in.next();}
      String nln()throws Exception{return in.nextLine();}
      int ni()throws Exception{return Integer.parseInt(in.next());}
      long nl()throws Exception{return Long.parseLong(in.next());}
      double nd()throws Exception{return Double.parseDouble(in.next());}
  
      class FastReader{
          BufferedReader br;
          StringTokenizer st;
          public FastReader(){
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public FastReader(String s) throws Exception{
              br = new BufferedReader(new FileReader(s));
          }
  
          String next() throws Exception{
              while (st == null || !st.hasMoreElements()){
                  try{
                      st = new StringTokenizer(br.readLine());
                  }catch (IOException  e){
                      throw new Exception(e.toString());
                  }
              }
              return st.nextToken();
          }
  
          String nextLine() throws Exception{
              String str;
              try{
                  str = br.readLine();
              }catch (IOException e){
                  throw new Exception(e.toString());
              }
              return str;
          }
      }
  }