#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define inf 100000000000
#define mod 1000000007
 ll power(ll x,ll n)
{
    if(n==0)
        return 1;
    else if(n%2 == 0)        //n is even
        return power((x*x),n/2);
    else                             //n is odd
        return (x*power((x*x),(n-1)/2));

}
ll C(ll n, ll r) {
    if(r > n - r) r = n - r; // because C(n, r) == C(n, n - r)
    long long ans = 1;
    int i;

    for(i = 1; i <= r; i++) {
        ans =((ans) * (n - r + i));
        ans =(ans)/i;
    }

    return ans;
}
ll modularExponentiation(ll x,ll n,ll M)
{
    if(n==0)
        return 1;
    else if(n%2 == 0)        //n is even
        return modularExponentiation((x*x)%M,n/2,M);
    else                             //n is odd
        return (x%M*modularExponentiation((x*x)%M,(n-1)/2,M)%M)%M;

}

ll modInverse(ll A,ll M)
{
    return modularExponentiation(A,M-2,M);
}
int prime_factorisation(int temp)
{
    int i,count=0;
    for(i=2;i*i<=temp;i++)
    {
        while(temp%i==0)
        {
            temp=temp/i;
            count++;
        }
    }
    if(temp>1)
        count++;
    return count;
}

ll divisors(ll temp,ll k)
{
    int i,temp1=1,t1;
    for(i=1;i<=temp/i;i++)
    {
        if(temp%i==0)
        {
            t1=temp/i;
            if(t1<=k)
                return t1;
            else if(i<=k)
            {
                    temp1=i;
            }
        }
    }
    return temp1;
}
void solve()
{
    ll n,i,even=0,odd=0,diff,temp;
    cin>>n;
    for(i=0;i<2*n;i++)
    {
        cin>>temp;
        if(temp%2==0)
            even++;
        else
            odd++;
    }
    if(even==odd)
        cout<<"YES"<<endl;

    else
        cout<<"NO"<<endl;
}
int main()
{
    ll t;
    cin>>t;
    while(t--)
    solve();
   return 0;
}
