## TUG - Tug of War

no tags

We want to pick a certain number of people from a group of N people and make them play a game of tug of war!

Then, we would like to split these people into two teams.

Afterwards, an intense game of tug of war would start.

However, when the strength of each team is not equivalent, the game is not very fun. A team's strength is the sum of the strengths of the people in the team.

Since you want the game that is fun, it is necessary to determine if it is possible to pick some people and split them into two teams such that the two teams' strengths are equal.

### Input

The input consists of a number of test cases.

The first line is the number of test case, T. (1<=T<=200)

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

The next line consists of N integers, separated by a space. The ith integer indicates the strength of the ith person. These integers are less than 100, but larger than 0.

### Output

For each test case, output "YES" if it is possible to pick some people from the group and separate into two teams of equal strengths. If not, output "NO". Refer to the sample test cases for further clarifications.

### Example

```Input:
2410 20 30 40310 18 15
Output:
YESNO ```
`There are a number of ways to pick teams for the first test case. One example would be {10,20} and {30}.`