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.
/*     🅻🅴🅰🆁🅽🅸🅽🅶      */
//✅ // 
	import java.util.*;
	import java.io.*;
	import java.lang.*;
	import java.math.BigInteger;

	public class A {
	
	static FastReader		sc	= new FastReader();
	static PrintWriter	out	= new PrintWriter(System.out);
	
	public static void main(String[] args) throws Exception {


		int t =sc.nextInt();
		while (t-- > 0) {
			A.go();
		}
		out.flush();
		
	}
	
	//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Code Starts <<<<<<<<<<<<<<<<<<<<<<<<<<<<< //

	static void go() {
		int n=sc.nextInt();
		int a[]=sc.intArray(n);
		for(int i=0;i<n;i++) {
			if(a[i]<0) {
				out.println("YES");
				return;
			}
		}
		out.println("NO");
		
		
	}


	
	static class helper implements Comparable<helper>{
		int x,y;
		helper(int x,int y){
			this.x=x;
			this.y=y;
		}
		@Override
		public int compareTo(helper o) {
			// TODO Auto-generated method stub
			return Integer.compare(this.x, o.x);
		}
	}

	static void   prints(char  a[][]) {

	for(int i=0;i<a.length;i++) {
		for(int j=0;j<a[i].length;j++) {
			out.print(a[i][j]);
		}
		out.println();
	}
}

	//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Code Ends <<<<<<<<<<<<<<<<<<<<<<<<<<<<< //
	static long fact[];
	static long invfact[];
	static long ncr(int n,int k) {
		if(k<0||k>n) {
			return 0;
		}
		long x=fact[n]%mod;
		long y=invfact[k]%mod;
		long yy=invfact[n-k]%mod;
		long ans=(x*y)%mod;
		ans=(ans*yy)%mod;
		return ans;
	}
	static long gcd(long a, long b) {
		if (b==0) {
			return a;
		}return gcd(b, a%b);
	}
	
	static int	prime[]	= new int[200005];
	static int	N				= 200005;
	
	static void sieve() {
	
		for(int i=0;i<N;i++) {
			prime[i]=i;
	}
		for (int i = 2; i * i <= N; i++) {
			if (prime[i] == i) {
				prime[i]=i;
				for (int j = i; j < N; j += i) {
					prime[j] =i;
				}}}
	}
	
	
	static int gcd(int a, int b) {
		if (b == 0) {
			return a;
		}return gcd(b, a % b);
	}
	 static void sort(int[] a) {
		ArrayList<Integer> aa = new ArrayList<>();
		for (Integer i : a) {
			aa.add(i);	}
		Collections.sort(aa);
		for (int i = 0; i < a.length; i++)
			a[i] = aa.get(i);}
	
	 static void sort(long[] a) {
		ArrayList<Long> aa = new ArrayList<>();
		for (Long i : a) {
			aa.add(i);}
		Collections.sort(aa);
		for (int i = 0; i < a.length; i++)
			a[i] = aa.get(i);
	}
	
	static int mod = (int) 1e9 + 7;
	
	static long pow(long x, long y) {
		long res = 1l;
		while (y != 0) {
			if (y % 2 == 1) {
				res = (x%mod * res%mod)%mod;
				}	y /= 2;
				x = (x%mod * x%mod)%mod;
		}
		return res%mod;
	}
	
	
	//>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Fast IO <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< //
	
	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());
		}
		int[] intArray(int n) {
			int a[]=new int[n];
			for(int i=0;i<n;i++)a[i]=sc.nextInt();
			return a;
		}
		long[] longArray(int n) {
			long a[]=new long[n];
			for(int i=0;i<n;i++)a[i]=sc.nextLong();
			return a;
		}
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}	}}
