B. Grab the Candies

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mihai and Bianca are playing with bags of candies. They have a row a� of n� bags of candies. The i�-th bag has ai�� candies. The bags are given to the players in the order from the first bag to the n�-th bag.

If a bag has an even number of candies, Mihai grabs the bag. Otherwise, Bianca grabs the bag. Once a bag is grabbed, the number of candies in it gets added to the total number of candies of the player that took it.

Mihai wants to show off, so he wants to reorder the array so that at any moment (except at the start when they both have no candies), Mihai will have strictly more candies than Bianca. Help Mihai find out if such a reordering exists.

Input

The first line of the input contains an integer t� (1≤t≤10001≤�≤1000) — the number of test cases.

The first line of each test case contains a single integer n� (1≤n≤1001≤�≤100) — the number of bags in the array.

The second line of each test case contains n� space-separated integers ai�� (1≤ai≤1001≤��≤100) — the number of candies in each bag.

Output

For each test case, output "YES" (without quotes) if such a reordering exists, and "NO" (without quotes) otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

Example

input

Copy

3

4

1 2 3 4

4

1 1 1 2

3

1 4 3

output

Copy

YES
NO
NO

Note

In the first test case, Mihai can reorder the array as follows: [4,1,2,3][4,1,2,3]. Then the process proceeds as follows:

• the first bag has 44 candies, which is even, so Mihai takes it — Mihai has 44 candies, and Bianca has 00.
• the second bag has 11 candies, which is odd, so Bianca takes it — Mihai has 44 candies, and Bianca has 11.
• the third bag has 22 candies, which is even, so Mihai takes it — Mihai has 66 candies, and Bianca has 11.
• the fourth bag has 33 candies, which is odd, so Bianca takes it — Mihai has 66 candies, and Bianca has 44.

Since Mihai always has more candies than Bianca, this reordering works.

解题说明：无论数列怎么排序，Mihai最多能拿到所有偶数和的糖果，直接统计出数列中的奇数和以及偶数和判断即可。

#include
int main() 
{
	int n, T, ev, odd, tmp;
	scanf("%d", &T);
	while (T--)
	{
		ev = odd = 0;
		scanf("%d", &n);
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &tmp);
			if (tmp % 2) 
			{
				odd += tmp;
			}
			else
			{
				ev += tmp;
			}
		}
		if (ev > odd)
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;

}