
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define fo(i, n) for(ll i=0; i<n; ++i)
#define in(i, arr) for(auto &i:arr) cin>>i;
#define FO(i, k, n) for(ll i=k; i<n; ++i)
#define rev(i, n) for(ll i=n-1; i>=0; --i)
#define MOD 1000000007
#define all(arr) arr.begin(),arr.end()
#define sortall(arr) sort(all(arr))
#define endl "\n"
#define umpll unordered_map<ll,ll>
#define umpcl unordered_map<char,ll>
#define umpii unordered_map<int,int>
#define pii pair<int,int>
#define pll pair<ll,ll>


#ifndef ONLINE_JUDGE
#define db(x) cerr<<#x<<" "; _print(x); cerr<<endl;
#else
#define db(x)
#endif

void init_code() {

	ios::sync_with_stdio(true);
	cin.tie(NULL);
#ifndef ONLINE_JUDGE
	//.......for.debugging.purposes
	freopen("error.txt", "w", stderr);
#endif

}

template<class T> void _print(vector<T> v) {
	cerr << "[ ";
	for (T i : v) {
		_print(i); cerr << " ";
	}
	cerr << "]";
}
void _print(ll a) {
	cerr << a;
}
void _print(int a) {
	cerr << a;
}
void _print(char a) {
	cerr << a;
}
void _print(string a) {
	cerr << a;
}
void _print(bool a) {
	cerr << a;
}

ll gcd(ll a, ll b) {
	if (a == 0) return b;
	if (b == 0) return a;
	return gcd(b, a % b);
}
ll binpow(ll base, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = (res * base) % MOD;
		base = (base * base) % MOD;
		n >>= 1;
	}
	return res;
}
ll comb(ll n, ll r) {
	ll res = 1;
	if (r > n / 2) r = n - r;

	fo(i, r) {
		res *= n;
		res /= (i + 1);
		n--;
	}
	return res;
}
ll candy_day(vector<ll> arr, ll can) {
	ll tot = 0;
	ll i = 0;
	fo(i, arr.size()) {
		tot += arr[i] / can + (arr[i] % can ? 1 : 0);
	}
	db(can);
	db(tot);
	cerr << endl;
	return tot;
}
void solve() {
	ll n, even = 0, odd = 0;
	cin >> n;
	vector<ll> arr(2 * n);
	fo(i, 2 * n) {
		cin >> arr[i];
		if (arr[i] & 1) odd++;
		else even++;
	}
	if (even == odd && even == n) {
		cout << "YES" << endl;
		return;
	}
	cout << "NO" << endl;

}
int main()
{
	init_code();
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}
