#include <bits/stdc++.h>
using namespace std;
vector<int> a;
int n;
vector<int> ind;
bool f(int i) {}
int main() {
  int t;
  cin >> t;
  while (t--) {
    ind.clear();
    cin >> n;
    n *= 2;
    a.resize(n);
    for (int &e : a) cin >> e;
    int mx = a[0];
    for (int i = 0; i < n; i++) {
      if (mx < a[i]) {
        ind.push_back(i);
        mx = a[i];
      }
    }
    if (!ind.size()) {
      cout << "NO\n";
      continue;
    }
    int last = last = n - ind.back();
    for (int i = ind.size() - 1; i >= 1; i--) {
      ind[i] = ind[i] - ind[i - 1];
    }
    if (last != -1) {
      ind.push_back(last);
    }
    vector<vector<bool>> dp(ind.size(), vector<bool>(n / 2 + 1, false));
    dp[0][ind[0]] = true;
    for (int i = 1; i < ind.size(); i++) {
      for (int j = 0; j <= n / 2; j++) {
        if (j - ind[i] >= 0) {
          dp[i][j] = dp[i][j] || dp[i - 1][j - ind[i]];
        }
        dp[i][j] = dp[i][j] || dp[i - 1][j];
      }
    }
    cout << (dp[ind.size() - 1][n / 2] ? "YES\n" : "NO\n");
  }
  return 0;
}
