# Sponsors

ACM is organizing an event in Bitotsav' 13 for which Facebook has agreed to sponsor only if the ACM team is able to solve a puzzle. Here's a description of the puzzle:

Suppose there are N registrations for the event, each person having his/her own level of intelligence. The ACM team has to form two groups from those N registrations such that the sum of the intelligence level in the first group is equal to that of the second group. Some registrants might not be a part of either group.

Each group should have atleast 1 person.

The ACM team doesn't want to waste time on puzzles which cannot be solved.

All you need to do is to tell us if at all it is possible to solve the puzzle for the giving intelligence levels.

**Input**

The first line contains the number of test cases T ( 1 <= T <= 250 ).

Each test case starts with N, the number of registrants. ( 1 <= N <= 100,000 ).

The next line consists of N integers, separated by a space. The ith integer indicates the intelligence level of the ith person. These integersÂ are less than or equal to 100, but larger than 0.Â

**Output**

For each test case, output "YES" if it is possible to solve the puzzle. If not, output "NO". Refer to the sample test cases for further clarifications.

**SAMPLE INPUT**

2

4

10 20 30 40

3

10 18 15

**SAMPLE OUTPUT**

YES

NO

**Explanation**

There are a number of ways to pick groups for the first test case. One example would be {10,20} and {30}.

*Problem Setter: Rounak Tibrewal*

**Languages:**C,C++,Java