#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int m, w;
    cin >> m;
    w = m;
    m = m * 2;
    long long int a[m];
    for (long long int i = 0; i < m; i++) {
      cin >> a[i];
    }
    long long int fi[m], size = 0, i = 0;
    fi[0] = 0;
    while (i < m) {
      long long int small = a[i];
      long long int co = 1;
      i++;
      while (a[i] < small && i < m) {
        co++;
        i++;
      }
      size++;
      fi[size] = co;
    }
    m = size;
    vector<std::vector<long long int> > z(m + 1);
    for (long long int i = 0; i <= m; i++) {
      for (long long int j = 0; j <= w; j++) {
        z[i].push_back(0);
      }
    }
    for (long long int i = 0; i <= m; i++) {
      for (long long int j = 0; j <= w; j++) {
        if (i == 0 || j == 0) {
          z[i][j] = 0;
          continue;
        }
        z[i][j] = z[i - 1][j];
        if (j - fi[i] >= 0) {
          if (z[i - 1][j] < z[i - 1][j - fi[i]] + fi[i]) {
            z[i][j] = z[i - 1][j - fi[i]] + fi[i];
          }
        }
      }
    }
    for (long long int i = 0; i <= m; i++) {
      for (long long int j = 0; j <= w; j++) {
      }
    }
    if (z[m][w] == w) {
      cout << "YES";
    } else {
      cout << "NO";
    }
    cout << endl;
  }
  return 0;
}
