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: import java.util.*;
  import java.io.*;
  import java.math.*;
  
  public class Main {
      static StringBuilder sb;
      static dsu dsu;
      static long fact[];
      static int mod = (int) (1e9 + 7);
  
      static void solve() {
          int n = i();
          int []arr=readArray(n);
  
          int lo=1;
          int hi=(int)Math.pow(3, n);
  
          for(int i=lo;i<hi;i++){
              int sum=0;
              int idx=0;
              int temp=i;
              while(temp>0){
                  int rem=temp%3;
                  // System.out.println(rem);
                  temp=temp/3;
                  if(rem==1){
                      sum+=arr[idx];
                  }else if(rem==2){
                      sum-=arr[idx];
                  }
                  idx++;
              }
              if(sum==0){
                  sb.append("YES\n");
                  return;
              }
          }
          sb.append("NO\n");
          return;
      }
  
      public static void main(String[] args) {
          sb = new StringBuilder();
          int test = i();
          while (test-- > 0) {
              solve();
          }
          System.out.println(sb);
      }
  
      /*
       * fact=new long[(int)1e6+10]; fact[0]=fact[1]=1; for(int i=2;i<fact.length;i++)
       * { fact[i]=((long)(i%mod)1L(long)(fact[i-1]%mod))%mod; }
       */
      // **************NCR%P******************
      static long ncr(int n, int r) {
          if (r > n)
              return (long) 0;
  
          long res = fact[n] % mod;
          // System.out.println(res);
          res = ((long) (res % mod) * (long) (p(fact[r], mod - 2) % mod)) % mod;
          res = ((long) (res % mod) * (long) (p(fact[n - r], mod - 2) % mod)) % mod;
          // System.out.println(res);
          return res;
  
      }
  
      static long p(long x, long y)// POWER FXN //
      {
          if (y == 0)
              return 1;
  
          long res = 1;
          while (y > 0) {
              if (y % 2 == 1) {
                  res = (res * x) % mod;
                  y--;
              }
  
              x = (x * x) % mod;
              y = y / 2;
  
          }
          return res;
      }
  
      // **************END******************
  
      // *************Disjoint set
      // union*********//
      static class dsu {
          int parent[];
  
          dsu(int n) {
              parent = new int[n];
              for (int i = 0; i < n; i++)
                  parent[i] = -1;
          }
  
          int find(int a) {
              if (parent[a] < 0)
                  return a;
              else {
                  int x = find(parent[a]);
                  parent[a] = x;
                  return x;
              }
          }
  
          void merge(int a, int b) {
              a = find(a);
              b = find(b);
              if (a == b)
                  return;
              parent[b] = a;
          }
      }
  
      // **************PRIME FACTORIZE **********************************//
      static TreeMap<Integer, Integer> prime(long n) {
          TreeMap<Integer, Integer> h = new TreeMap<>();
          long num = n;
          for (int i = 2; i <= Math.sqrt(num); i++) {
              if (n % i == 0) {
                  int nt = 0;
                  while (n % i == 0) {
                      n = n / i;
                      nt++;
                  }
                  h.put(i, nt);
              }
          }
          if (n != 1)
              h.put((int) n, 1);
          return h;
  
      }
  
      // ****CLASS PAIR ************************************************
      static class Pair implements Comparable<Pair> {
          int x;
          long y;
  
          Pair(int x, long y) {
              this.x = x;
              this.y = y;
          }
  
          public int compareTo(Pair o) {
              return (int) (this.y - o.y);
  
          }
  
      }
      // ****CLASS PAIR **************************************************
  
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
  
          public int Int() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public String String() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public String next() {
              return String();
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  
      static class OutputWriter {
          private final PrintWriter writer;
  
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
  
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
  
          public void print(Object... objects) {
              for (int i = 0; i < objects.length; i++) {
                  if (i != 0)
                      writer.print(' ');
                  writer.print(objects[i]);
              }
          }
  
          public void printLine(Object... objects) {
              print(objects);
              writer.println();
          }
  
          public void close() {
              writer.close();
          }
  
          public void flush() {
              writer.flush();
          }
      }
  
      static InputReader in = new InputReader(System.in);
      static OutputWriter out = new OutputWriter(System.out);
  
      public static long[] sort(long[] a2) {
          int n = a2.length;
          ArrayList<Long> l = new ArrayList<>();
          for (long i : a2)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a2[i] = l.get(i);
          return a2;
      }
  
      public static long pow(long x, long y) {
          long res = 1;
          while (y > 0) {
              if (y % 2 != 0) {
                  res = (res * x);// % modulus;
                  y--;
  
              }
              x = (x * x);// % modulus;
              y = y / 2;
          }
          return res;
      }
  
      // GCD___+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
      public static long gcd(long x, long y) {
          if (x == 0)
              return y;
          else
              return gcd(y % x, x);
      }
      // ******LOWEST COMMON MULTIPLE
      // *********************************************
  
      public static long lcm(long x, long y) {
          return (x * (y / gcd(x, y)));
      }
  
      // INPUT PATTERN********************************************************
      public static int i() {
          return in.Int();
      }
  
      public static long l() {
          String s = in.String();
          return Long.parseLong(s);
      }
  
      public static String s() {
          return in.String();
      }
  
      public static int[] readArray(int n) {
          int A[] = new int[n];
          for (int i = 0; i < n; i++) {
              A[i] = i();
          }
          return A;
      }
  
      public static long[] readArrayL(int n) {
          long A[] = new long[n];
          for (int i = 0; i < n; i++) {
              A[i] = l();
          }
          return A;
      }
  
  }