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 sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
def get_int(): return int(sys.stdin.readline().strip())

# Output for list
# sys.stdout.write(" ".join(map(str, final)) + "\n")

# Output for int or str
# sys.stdout.write(str(best) + "\n")



def solve(n, arr):
  store = {}
  for ele in arr:
    if ele == 0:
      print("YES")
      return
    
    if ele in store:
      print("YES")
      return
    
    store[ele] = 1
  
  for i in range(n):
    for j in range(i+1, n):
      e1 = abs(arr[i])
      e2 = abs(arr[j])

      d1 = e1 + e2
      d2 = e1 - e2
      d3 = -e1 - e2
      d4 = -e1 + e2

      if d1 in store:
        print("YES")
        return
      
      if d2 in store:
        print("YES")
        return

      if d3 in store:
        print("YES")
        return
      
      if d4 in store:
        print("YES")
        return
      
      store[d1] = 1
      store[d2] = 1
      store[d3] = 1
      store[d4] = 1

  print("NO")
  return

      
  

  

  


  

  


T = get_int()
while T:
  n = get_int()
  arr = get_list()
  solve(n, arr)
  T -= 1
