Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

HS11PART - Half of a Set

You are given X, a set of n < 20 positive integers: x1, x2, ... xn, where xi < 20. Let S=x1 + x2 + ... + xn be the sum of all xi. Please, check if there exists a subset of X whose sum of elements is equal to S/2.

Input

First t < 500, the nuber of sets. Next, for each test case, two lines follow. The first contains n, while the second the n set elements, separated by spaces.

Output

For each test case output one word in a separate line: YES if it is possible to achieve S/2 and NO if it is impossible.

Example

Input:
4
3
2 1 3
3
11 10 9
4 
1 2 1 6
5
11 1 2 10 18

Output:
YES
NO
NO
YES

Comment:
1: 2 + 1 = 3
2: no solution
3: no solution
4: 11 + 10 = 1 + 2 + 18

Scoring

By solving this problem you score 10 points.


Added by:kuszi
Date:2012-01-17
Time limit:0.585s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM32-GCC ASM64 GAWK MAWK BC C-CLANG CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET
Resource:High School Programming League

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.