#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> A(2 * n);
  for (int i = 0; i < 2 * n; i++) {
    cin >> A[i];
  }
  int i = 2 * n - 1;
  vector<int> R;
  while (i >= 0) {
    int index = max_element(A.begin(), A.begin() + i + 1) - A.begin();
    R.push_back(i - index + 1);
    i = index - 1;
  }
  set<int> all_sums{0};
  for (int r : R) {
    set<int> tmp_all_sums;
    for (auto s : all_sums) {
      tmp_all_sums.insert(s);
      tmp_all_sums.insert(s + r);
      if (s + r == n) {
        cout << "YES\n";
        return;
      }
    }
    all_sums = move(tmp_all_sums);
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) solve();
}
