#include <bits/stdc++.h>
using namespace std;
bool isSubsetSum(vector<int> &set, int sum) {
  int n = set.size();
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (int i = 1; i <= sum; i++) subset[0][i] = false;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < set[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= set[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]];
    }
  }
  return subset[n][sum];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    int ary[2 * n];
    for (int i = 0; i <= 2 * n - 1; i++) cin >> ary[i];
    vector<int> temp, vec;
    temp.push_back(0);
    int mx = ary[0];
    for (int i = 1; i <= 2 * n - 1; i++) {
      if (ary[i] > mx) {
        temp.push_back(i);
        mx = ary[i];
      }
    }
    temp.push_back(2 * n);
    for (int i = 1; i <= temp.size() - 1; i++) {
      vec.push_back(temp[i] - temp[i - 1]);
    }
    sort(vec.begin(), vec.end());
    if (isSubsetSum(vec, n))
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
