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.*;
  import java.util.*;
  
  public class CFGlobal15D {
  	public static void solve(IO io) {
  
  		int n = io.getInt();
  		
  		int [] lol = new int[n];
  		
  		for (int i = 0; i < n; i++) {
  			lol[i] = Math.abs(io.getInt());
  		}
  		if (re(lol,0,0,false) ) {
  			System.out.println("YES");
  		} else {
  			System.out.println("NO");
  		}
  
  	}
  	
  	static boolean re(int [] lol, int index, int sum, boolean flag) {
  		if (index == lol.length) {
  			if (sum == 0 && flag) {
  				return true;
  			} else {
  				return false;
  			}
  		}
  		
  		return re(lol, index + 1, sum + lol[index], true) || re(lol, index + 1, sum, flag) || re(lol, index + 1, sum - lol[index], true);
  		
  	}
  
  	public static void main(String[] args) {
  		IO io = new IO();
  		int t = io.getInt();
  		for (int testIndex = 0; testIndex < t; testIndex++) {
  			solve(io);
  		}
  		io.close();
  	}
  
  	static class IO extends PrintWriter {
  
  		public IO() {
  			super(new BufferedOutputStream(System.out));
  			r = new BufferedReader(new InputStreamReader(System.in));
  		}
  
  		public IO(InputStream i) {
  			super(new BufferedOutputStream(System.out));
  			r = new BufferedReader(new InputStreamReader(i));
  		}
  
  		public IO(InputStream i, OutputStream o) {
  			super(new BufferedOutputStream(o));
  			r = new BufferedReader(new InputStreamReader(i));
  		}
  
  		public boolean hasMoreTokens() {
  			return peekToken() != null;
  		}
  
  		public int getInt() {
  			return Integer.parseInt(nextToken());
  		}
  
  		public double getDouble() {
  			return Double.parseDouble(nextToken());
  		}
  
  		public long getLong() {
  			return Long.parseLong(nextToken());
  		}
  
  		public String getWord() {
  			return nextToken();
  		}
  
  		private BufferedReader r;
  		private String line;
  		private StringTokenizer st;
  		private String token;
  
  		private String peekToken() {
  			if (token == null)
  				try {
  					while (st == null || !st.hasMoreTokens()) {
  						line = r.readLine();
  						if (line == null)
  							return null;
  						st = new StringTokenizer(line);
  					}
  					token = st.nextToken();
  				} catch (IOException e) {
  				}
  			return token;
  		}
  
  		private String nextToken() {
  			String ans = peekToken();
  			token = null;
  			return ans;
  		}
  	}
  }
  