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.util.*;
  import java.io.*;
  public class B{
  	public static void main(String[] args)
  	{
  		FastScanner fs = new FastScanner();
  		PrintWriter out = new PrintWriter(System.out);
  		int t = fs.nextInt();
  		for(int tt=0;tt<t;tt++)
  		{
  			int n = fs.nextInt();
  			int[] arr = fs.readArray(n);
  			
  			boolean flag = false;
  			
  			for(int i=1;i<(1<<n);i++)
  			{
  				List<Integer> temp = new ArrayList();
  				for(int pos=0;pos<n;pos++)
  				{
  					if(((1<<pos)&i)>0)
  					{
  						temp.add(arr[pos]);
  					}
  				}
  				for(int ii=0;ii<(1<<temp.size());ii++)
  				{
  					int cur = 0;
  					for(int pos=0;pos<temp.size();pos++)
  					{
  						if(((1<<pos)&ii)>0)
  						{
  							cur += temp.get(pos);
  						}
  						else cur -= temp.get(pos);
  					}
  					if(cur == 0)flag = true;
  				}
  				
  			}
  			
  			out.println(flag == true?"YES":"NO");
  			
  		}
  		out.close();
  	}
  	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());
  		}
  		int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	public static int[] sort(int[] arr)
  	{
  		List<Integer> temp = new ArrayList();
  		for(int i:arr)temp.add(i);
  		Collections.sort(temp);
  		int start = 0;
  		for(int i:temp)arr[start++]=i;
  		return arr;
  	}
  	public static String rev(String str)
  	{
  		char[] arr = str.toCharArray();
  		char[] ret = new char[arr.length];
  		int start = arr.length-1;
  		for(char i:arr)ret[start--] = i;
  		String ret1 = "";
  		for(char ch:ret)ret1+=ch;
  		return ret1;
  	}
  }