#include <bits/stdc++.h>
using namespace std;
int main() {
  int queries;
  cin >> queries;
  for (int q = 0; q < queries; ++q) {
    int n;
    cin >> n;
    std::vector<int> sizes;
    std::vector<int> vec(2 * n);
    for (auto& i : vec) {
      cin >> i;
    }
    vec.push_back(5 * n);
    int current_size = 1;
    int current_max = vec[0];
    for (int i = 1; i < 2 * n + 1; ++i) {
      if (vec[i] > current_max) {
        current_max = vec[i];
        sizes.push_back(current_size);
        current_size = 1;
      } else {
        ++current_size;
      }
    }
    std::vector<bool> possible(n + 1);
    std::vector<bool> newPos(n + 1);
    possible[0] = true;
    for (auto i : sizes) {
      for (int j = 0; j < n + 1; ++j) {
        if (possible[j] && j + i < n + 1) {
          newPos[j + i] = true;
        }
      }
      for (int j = 0; j < n + 1; ++j) {
        possible[j] = possible[j] || newPos[j];
      }
    }
    if (possible[n]) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
