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: /*input
  5
  5
  4 -7 -1 5 10
  4
  5 10 20 35
  3
  1 10 100
  2
  0 -7
  9
  25 -171 250 174 152 242 100 -205 -258
  
  
  */
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Main
  {
  	static PrintWriter out;
  	static int MOD = 1000000007;
  	static FastReader scan;
  
      /*-------- I/O usaing short named function ---------*/
  	public static String ns(){return scan.next();}
  	public static int ni(){return scan.nextInt();}
  	public static long nl(){return scan.nextLong();}
  	public static double nd(){return scan.nextDouble();}
  	public static String nln(){return scan.nextLine();}
  	public static void p(Object o){out.print(o);}
  	public static void ps(Object o){out.print(o + " ");}
  	public static void pn(Object o){out.println(o);}
      /*-------- for output of an array ---------------------*/
       static void iPA(int arr []){
       	 StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void lPA(long arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void sPA(String arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
  	static void dPA(double arr []){
  	     StringBuilder output = new StringBuilder();
  	     for(int i=0; i<arr.length; i++)output.append(arr[i] + " ");out.println(output);
  	}
      /*-------------- for input in an array ---------------------*/
  	static void iIA(int arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = ni();
  	}
  	static void lIA(long arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = nl(); 
  	}
  	static void sIA(String arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = ns(); 
  	}
  	static void dIA(double arr[]){
  	     for(int i=0; i<arr.length; i++)arr[i] = nd();
  	}
  	/*------------ for taking input faster ----------------*/
       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;
  		}
  	}
  
  	// Method to check if x is power of 2
      static boolean isPowerOfTwo (int x) { return x!=0 && ((x&(x-1)) == 0);}
      //Method to return gcd of two numbers
      static int gcd(int a, int b){return a==0?b:gcd(b % a, a); }
      //Method to count digit of a number
      static int countDigit(long n){return (int)Math.floor(Math.log10(n) + 1);}
      //Method for sorting
  	static void 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);
  	}
  	//Method for sorting
  	static void sort(long[] a) {
  		ArrayList<Long> l=new ArrayList<>();
  		for (long i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  	}
  	//Method foAr checking if a number is prime or not
  	static boolean isPrime(int n) { 
          if (n <= 1) return false; 
          if (n <= 3) return true; 
          if (n % 2 == 0 || n % 3 == 0) return false; 
          for (int i = 5; i * i <= n; i = i + 6) 
              if (n % i == 0 || n % (i + 2) == 0) 
              	return false; 
          return true; 
      } 
  
  	public static void main (String[] args) throws java.lang.Exception
  	{
          out =new PrintWriter(System.out);
          scan =new FastReader();
  		//for fast output sometimes
  		StringBuilder sb = new StringBuilder();
  		int t = ni();
  		while(t-->0){
  			int n = ni();
  			long arr[] = new long[n];
  			lIA(arr);
  
  			for(int i=0; i<n; i++){
  				if(arr[i] == 0){
  					long temp = arr[i];
  					arr[i] = arr[n-1];
  					arr[n-1] = temp;
  				}
  			}
  			
  			ArrayList<Long> list = new ArrayList<>();
  
  			boolean ans = false;
  			
  			ans = solve(arr, 0, 0l, 0);
  			
  			if(ans){
  				pn("YES");
  			}else{
  				pn("NO");
  			}
          }
          out.flush();
  		out.close();
  	}
  	public static boolean solve(long arr[], int idx, long sum, int count){
  		int n = arr.length;
  		if(idx == n){
  			if(sum == 0 && count > 0)
  				return true;
  			return false;
  		}
  		boolean ans = false;
  		
  		ans = solve(arr, idx+1, sum - arr[idx], count+1);
  		ans = ans || solve(arr, idx+1, sum + arr[idx], count + 1);
  		ans = ans || solve(arr, idx+1, sum, count);
  		ans = ans || solve(arr, idx+1, arr[idx] - sum, count+1);
  		return ans;
  	}
  	
  }