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: /* package codechef; // don't place package name! */
  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  /* Name of the class has to be "Main" only if the class is public. */
  public class Main
  {
      static Map<Integer,Integer> map;
      
      public static void find(int a[]) {
          int n=a.length;
          int total=1<<n;
          for(int i=0;i<total;i++) {
              int sum=0;
              for(int j=0;j<n;j++) {
                  if((i&(1<<j))!=0) sum+=a[j];
              }
              if(!map.containsKey(sum)) map.put(sum,1);
              else map.put(sum,map.get(sum)+1);
          }
      }
  	public static void main (String[] args) throws java.lang.Exception
  	{
  		// your code goes here
  		Scanner sc=new Scanner(System.in);
  		int t=sc.nextInt();
  		PrintWriter out=new PrintWriter(System.out);
  		while(t-->0) {
  		    int n=sc.nextInt();
  		    int a[]=new int[n];
  		    for(int i=0;i<n;i++) a[i]=sc.nextInt();
  		    map=new HashMap<>();
  		    find(a);
  		    boolean flag=false;
  		    
  		    for(Integer key:map.keySet()) {
  		        if(map.get(key)>=2) {
  		            flag=true;
  		            break;
  		        }
  		    }
  		    if(!flag) out.println("NO");
  		    else out.println("YES");
  		}
  		out.flush();
  		out.close();
  	}
  }
  