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: /*
   * akshaygupta26
   */
  import java.io.*;
  import java.util.*;
  public class D
  { 
  	
      public static void main(String[] args) 
  	{ 
  		FastReader sc=new FastReader(); 
  		StringBuffer ans=new StringBuffer();
  		int test=sc.nextInt();
  outer:	while(test-->0)
  		{
  			int n=sc.nextInt();
  			int arr[]=new int[n];
  			HashSet<Integer> set=new HashSet<>();
  			for(int i=0;i<n;i++) {
  				arr[i]=sc.nextInt();
  			}
  			
  			for(int i=0;i<(1<<n);i++) {
  				int sum=0;
  				for(int b=30;b>=0;b--) {
  					if(((i>>b)&1) == 1) {
  						sum+=arr[b];
  					}
  				}
  				if(set.contains(sum)) {
  					ans.append("YES\n");
  					continue outer;
  				}
  				set.add(sum);
  			}
  			
  			ans.append("NO\n");
  			
  		}
  		
  	    System.out.print(ans);
  	} 
      
      static int[][] graph(int N, int[][] edges) {
      	// For Undirected graphs
      	
          int[][] graph = new int[N][];
          int[] sz = new int[N];
          for (int[] e: edges) {
              sz[e[0]] += 1;
              sz[e[1]] += 1;
          }
          for (int i = 0; i < N; i++) {
              graph[i] = new int[sz[i]];
          }
          int[] cur = new int[N];
          for (int[] e: edges) {
              graph[e[0]][cur[e[0]]] = e[1];
              graph[e[1]][cur[e[1]]] = e[0];
              cur[e[0]] += 1;
              cur[e[1]] += 1;
          }
          return graph;
      }
   
      static long _gcd(long a,long b) {
      	if(b == 0) return a;
      	return _gcd(b,a%b);
      }
      
      static final Random random=new Random();
      
  	static void ruffleSort(int[] a) {
  		int n=a.length;//shuffle, then sort 
  		for (int i=0; i<n; i++) {
  			int oi=random.nextInt(n), temp=a[oi];
  			a[oi]=a[i]; a[i]=temp;
  		}
  		Arrays.sort(a);
  	}
  	
  	static void ruffleSort(long[] a) {
  		int n=a.length;//shuffle, then sort 
  		for (int i=0; i<n; i++) {
  			int oi=random.nextInt(n);
  			long temp=a[oi];
  			a[oi]=a[i]; a[i]=temp;
  		}
  		Arrays.sort(a);
  	}
  	
  	static class FastReader 
  	{ 
  		BufferedReader br; 
  		StringTokenizer st; 
  
  		public FastReader() 
  		{ 
  			br = new BufferedReader(new
  					InputStreamReader(System.in)); 
  		} 
  
  		String next() 
  		{ 
  			while (st == null || !st.hasMoreElements()) 
  			{ 
  				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()); 
  		} 
  
  		double nextDouble() 
  		{ 
  			return Double.parseDouble(next()); 
  		} 
  
  		String nextLine() 
  		{ 
  			String str = ""; 
  			try
  			{ 
  				str = br.readLine(); 
  			} 
  			catch (IOException e) 
  			{ 
  				e.printStackTrace(); 
  			} 
  			return str; 
  		} 
  	} 
  
  
  } 
  