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.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.math.BigInteger;
  import java.util.*;
  
  /**
   * @author Mubtasim Shahriar
   */
  
  public class ArrayDifferentiation {
  
      public static void main(String[] args) {
  
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader sc = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          Solver solver = new Solver();
  		int t = sc.nextInt();
  //        int t = 1;
          while (t-- != 0) {
              solver.solve(sc, out);
          }
          out.close();
  
      }
  
      static class Solver {
          public void solve(InputReader sc, PrintWriter out) {
              int n = sc.nextInt();
              int[] arr = sc.nextIntArray(n);
              int three2n = 1;
              for (int i = 0; i < n; i++) three2n *= 3;
              for(int k = 1; k < three2n; k++) {
                  int kcp = k;
                  int sum = 0;
                  if(k==27) {
                      int b = 2;
                  }
                  for (int i = 0; i < n; i++) {
                      int s = kcp % 3;
                      kcp /= 3;
                      if(s==2) s = -1;
                      sum += (arr[i]*s);
                  }
                  if(sum==0) {
                      out.println("YES");
                      return;
                  }
              }
              out.println("NO");
          }
      }
      static void sort(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sort(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sortDec(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static void sortDec(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static class InputReader {
          private boolean finished = false;
  
          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 peek() {
              if (numChars == -1) {
                  return -1;
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      return -1;
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar];
          }
  
          public int nextInt() {
              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 long nextLong() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long 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 nextString() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              StringBuilder res = new StringBuilder();
              do {
                  if (Character.isValidCodePoint(c)) {
                      res.appendCodePoint(c);
                  }
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) {
                  return filter.isSpaceChar(c);
              }
              return isWhitespace(c);
          }
  
          public static boolean isWhitespace(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          private String readLine0() {
              StringBuilder buf = new StringBuilder();
              int c = read();
              while (c != '\n' && c != -1) {
                  if (c != '\r') {
                      buf.appendCodePoint(c);
                  }
                  c = read();
              }
              return buf.toString();
          }
  
          public String readLine() {
              String s = readLine0();
              while (s.trim().length() == 0) {
                  s = readLine0();
              }
              return s;
          }
  
          public String readLine(boolean ignoreEmptyLines) {
              if (ignoreEmptyLines) {
                  return readLine();
              } else {
                  return readLine0();
              }
          }
  
          public BigInteger readBigInteger() {
              try {
                  return new BigInteger(nextString());
              } catch (NumberFormatException e) {
                  throw new InputMismatchException();
              }
          }
  
          public char nextCharacter() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              return (char) c;
          }
  
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E') {
                      return res * Math.pow(10, nextInt());
                  }
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E') {
                          return res * Math.pow(10, nextInt());
                      }
                      if (c < '0' || c > '9') {
                          throw new InputMismatchException();
                      }
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
  
          public boolean isExhausted() {
              int value;
              while (isSpaceChar(value = peek()) && value != -1) {
                  read();
              }
              return value == -1;
          }
  
          public String next() {
              return nextString();
          }
  
          public SpaceCharFilter getFilter() {
              return filter;
          }
  
          public void setFilter(SpaceCharFilter filter) {
              this.filter = filter;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
  
          public int[] nextIntArray(int n) {
              int[] array = new int[n];
              for (int i = 0; i < n; ++i) array[i] = nextInt();
              return array;
          }
  
          public int[] nextSortedIntArray(int n) {
              int array[] = nextIntArray(n);
              Arrays.sort(array);
              return array;
          }
  
          public int[] nextSumIntArray(int n) {
              int[] array = new int[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextLongArray(int n) {
              long[] array = new long[n];
              for (int i = 0; i < n; ++i) array[i] = nextLong();
              return array;
          }
  
          public long[] nextSumLongArray(int n) {
              long[] array = new long[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextSortedLongArray(int n) {
              long array[] = nextLongArray(n);
              Arrays.sort(array);
              return array;
          }
      }
  
  
  }
  