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.*;
  import java.util.*;
  
  
  public class Main {
     public static void main(String[] args) throws IOException {
        Scanner sc =new Scanner(System.in);
        int t=sc.nextInt();
        loop:while(t-->0){
           int n=sc.nextInt();
           int [] arr=sc.nextIntArr(n);
           for (int i = 0; i < arr.length; i++) {
              arr[i]=Math.abs(arr[i]);
           }
           Arrays.sort(arr);
           for (int i = 0; i < arr.length; i++) {
              for (int j = i+1; j < arr.length; j++) {
                 if(arr[i]==arr[j]) {
                    System.out.println("YES");
                    continue loop;
                 }
              }
           }
           HashMap<Integer,int[]> hm=new HashMap<>();
           hm.put(0,arr.clone());
           HashSet<Integer> hs=new HashSet<>();
           hs.add(0);
           while(!hm.isEmpty()){
              int key= (int) hm.keySet().toArray()[0];
              int []val=hm.remove(key);
              ArrayList<Integer> al=new ArrayList();
              for (int i = 0; i < val.length; i++) {
                 al.add(val[i]);
              }
              int size=al.size();
              for (int i = 0; i < size; i++) {
                 int dist=al.remove(0);
                 if(hs.contains(key+dist)){
                    System.out.println("YES");
                    continue loop;
                 }
                 hs.add(key+dist);
                 int [] narr=new int[al.size()];
                 for (int j = 0; j < narr.length; j++) {
                       narr[j]=al.get(j);
                 }
                 hm.put(key+dist,narr);
              }
              //System.out.println(key+" "+Arrays.toString(val));
           }
           System.out.println("NO");
        }
     }
  
     public static class Scanner {
        StringTokenizer st;
        BufferedReader br;
  
        public Scanner(InputStream s) {
           br = new BufferedReader(new InputStreamReader(s));
        }
  
        public Scanner(FileReader r) {
           br = new BufferedReader(r);
        }
  
        public String next() throws IOException {
           while (st == null || !st.hasMoreTokens())
              st = new StringTokenizer(br.readLine());
           return st.nextToken();
        }
  
        public int nextInt() throws IOException {
           return Integer.parseInt(next());
        }
  
        public long nextLong() throws IOException {
           return Long.parseLong(next());
        }
  
        public String nextLine() throws IOException {
           return br.readLine();
        }
  
        public double nextDouble() throws IOException {
           return Double.parseDouble(next());
        }
  
        public int[] nextIntArr(int n) throws IOException {
           int[] arr = new int[n];
           for (int i = 0; i < arr.length; i++)
              arr[i] = nextInt();
           return arr;
        }
  
        public boolean ready() throws IOException {
           return br.ready();
        }
     }
  
  }