#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> v(2 * n);
  for (long long int i = 0; i < (2 * n); i++) {
    cin >> v[i];
  }
  vector<long long int> pkg;
  long long int cur = -1, count = 0;
  for (long long int i = 0; i < (2 * n); i++) {
    if (v[i] > cur) {
      cur = v[i];
      if (count > 0) pkg.push_back(count);
      count = 0;
    }
    count++;
  }
  if (count > 0) pkg.push_back(count);
  sort((pkg).begin(), (pkg).end());
  vector<vector<long long int> > dp(pkg.size() + 1,
                                    vector<long long int>(n + 1));
  for (long long int i = 0; i < (pkg.size() + 1); i++) {
    dp[i][0] = 1;
  }
  for (long long int i = 0; i < (pkg.size() + 1); i++) {
    for (long long int j = 0; j < (n + 1); j++) {
      if (i > 0) dp[i][j] = dp[i][j] || dp[i - 1][j];
      if (i < pkg.size() && dp[i][j] == 1 && j + pkg[i] <= n) {
        dp[i + 1][j + pkg[i]] = 1;
      }
    }
  }
  if (dp[pkg.size()][n])
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
