func_code_string: // REMEMBER USING MOD INVERSE WHILE DOING COMBINATORICS   // REMEMBER using int32_t while typecasting size into int      #include<bits/stdc++.h>   using namespace std;   #define pb push_back   #define int long long   #define all(x) x.begin(),x.end()   #define nl    n    #define ok  cout<< OK n    #define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)   #define free freopen( input.txt , r ,stdin);freopen( output.txt , w ,stdout)   #define ff first   #define ss second   typedef pair<int,int> pii;   const long long INF = 1ll << 32;   const long long MAX_N = 3e6 + 5;   const long long MOD = 1e9 + 7;      const long long N = 5001;      int I;      void solve()   {       int n;       cin>>n;       int even = 0 , odd = 0;       for(int i = 0 ; i<2 * n ; i++) {           int p;           cin>>p;           if(p & 1) odd++;           else even++;       }       cout<<(even == odd ?  Yes  :  No )<<nl;      }      int32_t main()   {       ios;       int Test = 1;       cin>>Test;       for(I = 1 ; I<=Test ;  I++)       {           solve();       }               }   