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 bisect import insort,bisect_right,bisect_left
  from sys import stdout, stdin, setrecursionlimit
  from heapq import heappush, heappop, heapify 
  from io import BytesIO, IOBase
  from collections import *
  from itertools import *
  from random import * 
  from string import *
  from queue import *
  from math import *
  from re import *
  from os import *
  
  # sqrt,ceil,floor,factorial,gcd,log2,log10,comb
  
  ####################################---fast-input-output----#########################################
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = read(self._fd, max(fstat(self._fd).st_size, 8192))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = read(self._fd, max(fstat(self._fd).st_size, 8192))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  stdin, stdout = IOWrapper(stdin), IOWrapper(stdout)
  graph, mod, szzz =  {}, 10**9 + 7, lambda: sorted(zzz())
  def getStr(): return input()
  def getInt(): return int(input())
  def listStr(): return list(input())
  def getStrs(): return input().split()
  def isInt(s): return '0' <= s[0] <= '9'
  def input(): return stdin.readline().strip()
  def zzz(): return [int(i) for i in input().split()]
  def output(answer, end='\n'): stdout.write(str(answer) + end)
  def lcd(xnum1, xnum2): return (xnum1 * xnum2 // gcd(xnum1, xnum2))
  
  
  def getPrimes(N = 10**5):
      SN = int(sqrt(N))
      sieve = [i for i in range(N+1)]
      sieve[1] = 0
      for i in sieve:
          if i > SN:
              break
          if i == 0:
              continue
          for j in range(2*i, N+1, i):
              sieve[j] = 0
      prime = [i for i in range(N+1) if sieve[i] != 0] 
      return prime
  def primeFactor(n,prime=getPrimes()):
      lst = []
      mx=int(sqrt(n))+1
      for i in prime:
          if i>mx:break
          while n%i==0:
              lst.append(i)
              n//=i
      if n>1:
          lst.append(n)
      return lst    
  
  dx = [-1, 1, 0, 0, 1, -1, 1, -1]
  dy = [0, 0, 1, -1, 1, -1, -1, 1]
  daysInMounth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
  
  
  #################################################---Some Rule For Me To Follow---#################################
  """
      --instants of Reading problem continuously try to understand them.
  
      --Try & again try, maybe you're just one statement away!
  
  
  """
  ##################################################---START-CODING---###############################################
  
  
  num = getInt()
  def solve(arr):
      s=[0]
  
      for i in arr:
          new=[]
          for j in s:
              new.append(i+j)
              new.append(i-j)
          yield from new
          s+=new
  
  for _ in range(num):
      n = getInt()
      arr = zzz()
      print("YES" if 0 in solve(arr) else "No")
  
  
  