#include <bits/stdc++.h>
using namespace std;
const int mxn = 4000 + 5;
long long int n, m;
void solve() {
  cin >> n;
  long long int a[2 * n];
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  vector<pair<int, int>> store(2 * n, {0, 0});
  store[0].first = a[0];
  store[0].second = 0;
  for (int i = 1; i < 2 * n; i++) {
    if (a[i] > store[i - 1].first) {
      store[i].first = a[i];
      store[i].second = i;
    } else {
      store[i] = store[i - 1];
    }
  }
  vector<int> s;
  int c = 1;
  for (int i = 2 * n - 1; i >= 1; i--) {
    if (store[i].second == store[i - 1].second) {
      c++;
    } else {
      s.push_back(c);
      c = 1;
    }
  }
  if (c) s.push_back(c);
  vector<vector<bool>> cache(s.size() + 1, vector<bool>(n + 1, 0));
  for (int i = 0; i <= s.size(); i++) cache[i][0] = 1;
  for (int i = 1; i <= n; i++) cache[0][i] = 0;
  for (int i = 1; i <= s.size(); i++) {
    for (int j = 1; j <= n; j++) {
      if (j < s[i - 1]) {
        cache[i][j] = cache[i - 1][j];
      } else {
        cache[i][j] = cache[i - 1][j] || cache[i - 1][j - s[i - 1]];
      }
    }
  }
  if (cache[s.size()][n]) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  ;
  long long int testcase;
  cin >> testcase;
  while (testcase--) solve();
}
