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: from collections import Counter, defaultdict, deque
  import bisect
  from sys import stdin, stdout
  from itertools import repeat, permutations
  import math
  import heapq
  
  MOD = 998244353
  def inp(force_list=False):
      re = map(int, raw_input().split())
      if len(re) == 1 and not force_list:
          return re[0]
      return re
  
  def inpf(force_list=False):
      re = map(float, raw_input().split())
      if len(re) == 1 and not force_list:
          return re[0]
      return re
  
  def inst():
      return raw_input().strip()
  
  def gcd(x, y):
     while(y):
         x, y = y, x % y
     return x
  
  def lcm(x, y):
      return x*y/(gcd(x,y))
  
  def qmod(a, b, mod=MOD):
      res = 1
      while b:
          if b&1:
              res = (res*a)%mod
          b >>= 1
          a = (a*a)%mod
          # print b
      return res
  
  def inv(a):
      return qmod(a, MOD-2)
  
  def query(num):
      print num
      stdout.flush()
      return inp()
  
  def my_main():
      kase = inp()
      pans = []
      cur = []
      for _ in range(kase):
          n = inp()
          da = inp(True)
          ok = 0
          for i in xrange(1, 3**n):
              if ok:
                  break
              sum = 0
              for j in range(n):
                  st = i%3
                  i /= 3
                  if st==1:
                      sum += da[j]
                  elif st==2:
                      sum -= da[j]
              if sum==0:
                  ok = 1
                  break
          pans.append("YES" if ok else "NO")
  
      print '\n'.join(pans)
  
  
  my_main()
  