#include<bits/stdc++.h>
using namespace std;
 
#define ll              long long int 
#define mp              make_pair
#define pb              push_back
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define msbindex(x)     __lg(x)
#define lsbindex(x)     __builtin_ffs(x)
#define mod             1000000007
#define inf             1e18
#define fr(i,k,n)       for (int i=k;i<n;i++)
#define frr(i,k,n)      for (int i = k; i >= n; i--)
#define sp(x,y)         fixed<<setprecision(y)<<x
#define w(x)            int x; cin>>x; while(x--)
#define f(n)            int n; cin>>n; int ar[n];for(int i=0;i<n;i++) cin>>ar[i];
 
void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int p[1000005];
void primeSeive()
{
  for(ll i=3;i<=1000000;i+=2)
    p[i]=1;
    
  for(ll i=3;i<=1000000;i+=2)
  {
    if(p[i]==1)
    {
      for(ll j=i*i;j<=1000000;j=j+i){
        p[j]=0;
      }
    }
    } 
   p[2]=1;
   p[1]=p[0]=0;    
}

ll power(ll x, ll y)
{
    ll temp;
    if( y == 0)
        return 1;
    temp = power(x, y / 2);
    if (y % 2 == 0)
        return temp * temp;
    else
        return x * temp * temp;
}

int main()
{  
    c_p_c();
    w(x)
    {
      ll n;
      cin>>n;
      ll a=0,b=0;
      fr(i,0,2*n)
      {
        int value;
        cin>>value;
        if(value%2==0)
          a++;
        else 
          b++;
      }
      if(a==b)
        cout<<"Yes"<<endl;
      else
        cout<<"No"<<endl;
    }
    return 0;
}