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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.HashSet;
  import java.util.StringTokenizer;
  
  public class d {
  	public static void main(String[] args) {
  		FastScanner scan=new FastScanner();
  		PrintWriter out=new PrintWriter(System.out);
  		
  		int t=scan.nextInt();
  		t:for(int tt=0;tt<t;tt++) {
  			int n=scan.nextInt();
  			int[] a=new int[n];
  			for(int i=0;i<n;i++) a[i]=Math.abs(scan.nextInt());
  			for(int skip=0;skip<n;skip++) {
  				HashSet<Integer> get=new HashSet<>();
  				get.add(0);
  				for(int i=0;i<n;i++) {
  					if(i==skip) continue;
  					HashSet<Integer> nxt=new HashSet<>();
  					for(int x:get) {
  						nxt.add(Math.abs(x-a[i]));
  						nxt.add(x+a[i]);
  					}
  					nxt.add(a[i]);
  					get.addAll(nxt);
  					if(get.contains(a[skip])) {
  						out.println("YES");
  						continue t;
  					}
  				}
  				if(get.contains(a[skip])) {
  					out.println("YES");
  					continue t;
  				}
  			}
  			out.println("NO");
  		}
  		out.close();
  	}
  	static class FastScanner {
  		BufferedReader br;
  		StringTokenizer st;
  
  		public FastScanner() {
  			try	{
  				br = new BufferedReader(new InputStreamReader(System.in));
  				st = new StringTokenizer(br.readLine());
  			} catch (Exception e){e.printStackTrace();}
  		}
  
  		public String next() {
  			if (st.hasMoreTokens())	return st.nextToken();
  			try {st = new StringTokenizer(br.readLine());}
  			catch (Exception e) {e.printStackTrace();}
  			return st.nextToken();
  		}
  
  		public int nextInt() {return Integer.parseInt(next());}
  
  		public long nextLong() {return Long.parseLong(next());}
  
  		public double nextDouble() {return Double.parseDouble(next());}
  
  		public String nextLine() {
  			String line = "";
  			if(st.hasMoreTokens()) line = st.nextToken();
  			else try {return br.readLine();}catch(IOException e){e.printStackTrace();}
  			while(st.hasMoreTokens()) line += " "+st.nextToken();
  			return line;
  		}
  	}
  }
  