#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  for (int tt = 0; tt < t; tt++) {
    int n;
    cin >> n;
    vector<int> p(2 * n);
    for (int i = 0; i < 2 * n; i++) cin >> p[i];
    vector<int> x;
    int max = 0;
    for (int i = 0; i < 2 * n; i++) {
      if (max < p[i]) {
        x.push_back(i);
        max = p[i];
      }
    }
    x.push_back(2 * n);
    vector<int> y;
    for (int i = 1; i < x.size(); i++) {
      y.push_back(x[i] - x[i - 1]);
    }
    int m = y.size();
    vector<vector<bool>> b((m + 1), vector<bool>(n + 1, false));
    b[0][0] = true;
    for (int i = 1; i < m + 1; i++) {
      for (int j = 1; j < n + 1; j++) {
        if (y[i - 1] > j)
          b[i][j] = b[i - 1][j];
        else {
          b[i][j] = b[i - 1][j];
          if (b[i][j] == false) b[i][j] = b[i - 1][j - y[i - 1]];
        }
      }
    }
    if (b[m][n] == true)
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
