#include<bits/stdc++.h>
#define ull signed long long int
#define int64 int64_t
#define mod 1000000007
#define repi(x,y,z) for(ull i=x;i<=y;i+=z)
#define repj(x,y,z) for(ull j=x;j<=y;j+=z)
#define pb push_back
#define eb emplace_back;
#define mod1  998244353
#define nl '\n'
//#define back continue
//#define setbits(x)  __builtin_popcount(ull x)
#define all(x) (x).begin(),(x).end()
#define accending(a,n) sort(a,a+n)
#define decending(a,n) sort(a,a+n,greater<ull>())
#define sortacc(v) sort(v.begin(),v.end())
#define sortde(v) sort(v.rbegin(),v.rend())
#define rev(v) reverse(v.begin(),v.end())
using namespace std;
 
ull binaryToDecimal(string n)
{
    string num = n;
    ull dec = 0;
 
    ull base = 1;
 
    ull len = num.length();
    for (ull i = len - 1; i >= 0; i--) {
        if (num[i] == '1')
            dec += base;
        base = base * 2;
    }
 
    return dec;
}
 
 
string decToBinary32(ull n)
{
  string s="";
    
    for (ull i = 31; i >= 0; i--) {
        ull k = n >> i;
        if (k & 1)
            s+='1';
        else
            s+='0';
    }
    return s;
}
 
string decToBinary(ull n)
{
    
    ull binaryNum[32];
    string s;
 
    ull i = 0;
    while (n > 0) {
 
        binaryNum[i] = n % 2;
        n = n / 2;
        i++;
    }
 
    for (ull j = i - 1; j >= 0; j--)
        s+=to_string(binaryNum[j]);
 
    return s;
}
 
bool isprime(ull n)
{
  bool flag=true;
  for (ull i = 2; i*i<=n; i++)
   {
 
        if (n % i == 0)
         {
            flag = false;
            break;
        }
    }
 
    if (n <= 1)
        flag = false;
 
    return flag;
}
 
 
ull setbits(ull n)
{
    ull count=0;
    while(n>0)
    {
        count++;
        n=n>>1;
    }
    return count;
}
 
 bool ispallindrome(string s)
 {
  string t(s.rbegin(),s.rend());
 
  return (t==s);
 
 }
 
ull nCrModp(ull n, ull r, ull p)
{
    
    if (r > n - r)
        r = n - r;
 
    ull C[r + 1];
    memset(C, 0, sizeof(C));
 
    C[0] = 1; 
    for (ull i = 1; i <= n; i++) {
 
        
        for (ull j = min(i, r); j > 0; j--)
 
            
            C[j] = (C[j] + C[j - 1]) % p;
    }
    return C[r];
}

bool is_true(string s)
{
    set<char> st;
     //(s.begin(),s.end());
    repi(0,s.size()-1,1)
    {
        st.insert(s[i]);
    }

     if(st.size()==s.size())
        return true;
    else
        return false;
}


 
 
 
 
int main()
{
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ull tc;
    cin>>tc;
    while(tc--)
    {
      ull n;
      cin>>n;
      ull a[2*n];
      ull odd=0,even=0;
      repi(0,(2*n)-1,1)
      {
        cin>>a[i];
        if(a[i]&1)
        {
          odd++;
        }
      }
     if(odd==n)
     {
      cout<<"Yes"<<nl;
     }
     else
     {
      cout<<"No"<<nl;
     }



    }

  return 0;
    
}
