#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> p(2 * n);
  vector<int> len;
  for (int i = 0; i < 2 * n; i++) {
    cin >> p[i];
  }
  int cur = 0, head = p[0];
  for (int i = 0; i < 2 * n; i++) {
    if (p[i] <= head) {
      cur++;
    } else {
      head = p[i];
      len.push_back(cur);
      cur = 1;
    }
  }
  len.push_back(cur);
  vector<vector<bool> > dp(len.size(), vector<bool>(n + 1, 0));
  dp[0][0] = 1;
  if (len[0] <= n) dp[0][len[0]] = 1;
  for (int i = 1; i < len.size(); i++) {
    for (int j = 0; j <= n; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j >= len[i]) {
        if (dp[i - 1][j - len[i]]) dp[i][j] = 1;
      }
    }
  }
  if (dp[len.size() - 1][n]) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
