## 文理学院程序设计在线练习

Time Limit: 1 Second(s)    Memory Limit: 32 MB

Total Submission(s): 19   Accepted Submission(s): 8
Problem Description

Everyday Lijiang buys N jars of cookies, there are cookies in the ith jar. And she decided to eat all the cookies bought on that day .
Lijiang has her own principle of eating cookies. Every time Lijiang chooses two cookies jars with cookies remaining. Then take a cookie from each of the two Cookie Jars and eat them.
Sometimes she will find that no matter how she eats, she can't eat all cookies. What a sad thing it is!
If one method exists, output ”Yes”, otherwise, output “No” （without quotes）.

Input

The first line of data is a positive integer T，it means T days together.
For each day the first line is an integer N, representing the N jars of cookies Lijiang buys on that day.
The next line will have a N integer , which stands for cookies in the i th jar.
It is guaranteed:

Output

Every test case output one line, donates the answer.

Sample Input
```3
3
1 1 1
2
1 1
3
1 2 1
```
Sample Output
```No
Yes
Yes
```
Hint

long long数据   scanf请输入使用"%I64d"
day 1:
No matter how to eat, cookies will be remained.
day 2:
eat 1: jar 1+jar 2.
conclusion: all cookies will be eaten.
day 3:
case 1:
eat 1: jar 1+jar 3
eat 2:Only jar 2 remains cookies.
conclusion : cookies will be remained.
case 2:
eat 1: jar 1+jar 2
eat 2: jar 2+jar 3
conclusion: all cookies will be eaten.

Source

2018市赛