#include <bits/stdc++.h>
using namespace std;
bool isSubsetSum(vector<int>& set, int n, int sum) {
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (int i = 1; i <= sum; i++) subset[0][i] = false;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < set[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= set[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]];
    }
  }
  return subset[n][sum];
}
void solve() {
  int n;
  cin >> n;
  n = 2 * n;
  vector<int> a(n), mx(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  mx[0] = a[0];
  map<int, int> mp;
  mp[mx[0]]++;
  for (int i = 1; i < n; i++) {
    mx[i] = max(a[i], mx[i - 1]);
    mp[mx[i]]++;
  }
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    if (mp[i] != 0) {
      ans.push_back(mp[i]);
    }
  }
  int k = ans.size();
  if (isSubsetSum(ans, k, n / 2)) {
    cout << "YES\n";
  } else {
    printf("NO\n");
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
