                              ////JAI SHREE RAM////
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const long long int INF = (long long)1e15;
const long long int mod = 1e9+7;
#define ll long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define all(c) c.begin(),c.end()
#define rall(c) c.rbegin(),c.rend()
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define sd second
#define ft first
//
bool cmp(const pair<int,int> &a, const pair<int,int> &b)
{
    //return (a.sd>=b.sd);
    return abs(a.ft)+abs(a.sd) < abs(b.ft)+abs(b.sd);
}

void solve()
{
    int n;cin>>n;
    int o=0;
    n*=2;
    f(i,0,n){
        int x;cin>>x;
        if(x%2) o++;
    }
    if(o==n/2) yes;
    else no;
}
int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;

    while(t--)
    {
        solve();
    }
    return 0;
}

