Odd Set
You are given a multiset (i. e. a set that can contain multiple equal integers) containing $$$2n$$$ integers. Determine if you can split it into exactly $$$n$$$ pairs (i. e. each element should be in exactly one pair) so that the sum of the two elements in each pair is odd (i. e. when divided by $$$2$$$, the remainder is $$$1$$$).
In the first test case, a possible way of splitting the set is $$$(2,3)$$$, $$$(4,5)$$$.In the second, third and fifth test case, we can prove that there isn't any possible way.In the fourth test case, a possible way of splitting the set is $$$(2,3)$$$.
The input consists of multiple test cases. The first line contains an integer $$$t$$$ ($$$1\leq t\leq 100$$$) — the number of test cases. The description of the test cases follows.The first line of each test case contains an integer $$$n$$$ ($$$1\leq n\leq 100$$$).The second line of each test case contains $$$2n$$$ integers $$$a_1,a_2,\dots, a_{2n}$$$ ($$$0\leq a_i\leq 100$$$) — the numbers in the set.
For each test case, print "Yes" if it can be split into exactly $$$n$$$ pairs so that the sum of the two elements in each pair is odd, and "No" otherwise. You can print each letter in any case.
for s in [*open(0)][2::2]:
    print('YNeos'[sum((int(x) % 2 * 2 - 1 for x in s.split())) != 0::2])
def can_split_into_pairs(n, nums):
    odd_count = 0
    even_count = 0
    for num in nums:
        if num % 2 == 0:
            even_count += 1
        else:
            odd_count += 1
    return odd_count == even_count
t = int(input())
for _ in range(t):
    n = int(input())
    nums = list(map(int, input().split()))
    result = 'Yes' if can_split_into_pairs(n, nums) else 'No'
    print(result)
for t in range(int(input())):
    n = int(input())
    a = list(map(int, input().split()))
    b = []
    c = []
    for i in a:
        if i % 2 == 0:
            b.append(i)
        else:
            c.append(i)
    if len(b) == len(c):
        print('YES')
    else:
        print('NO')