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.util.StringTokenizer;
  import java.util.*;
   
   
  public class C {
  	static int ile;
  	public static void main(String[] args) {
  		FastScanner fs = new FastScanner();
  		int T = fs.nextInt();
  		while(T-->0) {
  			int n = fs.nextInt();
  			int[] a = new int[n];
  			int[] b= new int[n-1];
  			for(int i =0;i<n;++i) {
  				a[i] = fs.nextInt();
  				a[i] = Math.abs(a[i]);
  			}
  			boolean czy = false;
  			for(int i =0;i<n;++i) {
  				for(int mask = 0;mask<(1<<n);++mask) {
  					ArrayList<Integer> l = new ArrayList<>();
  					for(int j = 0;j<n;++j) {
  						if((((1<<j)&mask)!=0)&&(i!=j)) {
  							l.add(a[j]);
  						}
  					}
  					//System.out.println(l);
  						int sz = l.size();
  						for(int innermask = 0; innermask<(1<<sz);++innermask) {
  							int sum = 0;
  							for(int x = 0;x<sz;++x) {
  								if(((1<<x)&innermask)!=0) {
  									sum-=l.get(x);
  								}else sum+=l.get(x);
  							}
  							//System.out.println(a[i]+" "+sum);
  							if(sum==a[i]){
  								czy = true;
  								break;
  							}
  						}
  				}
  				if(czy)break;
  			}
  			if(czy)System.out.println("YES");
  			else System.out.println("NO");
  		}
  	}
  	static int[] sort(int[] a) {
  		ArrayList<Integer> l =new ArrayList<>();
  		for(int i: a) {
  			l.add(i);
  		}
  		Collections.sort(l);
  		for(int i =0;i<a.length;++i) {
  			a[i] = l.get(i);
  		}
  		return a;
  	}
  	
  	static long gcd(long a, long b) {
  		long t;
  		while(b>0) {
  			t = b;
  			b = a%b;
  			a = t;
  		}
  		return a;
  	}
  	
  	static class FastScanner{
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		String next() {
  			while(!st.hasMoreTokens())
  				try {
  					st = new StringTokenizer(br.readLine());
  				}catch(IOException e){
  					e.printStackTrace();
  				}
  				return st.nextToken();
  		}
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  }