#include <bits/stdc++.h>
using namespace std;
const int N = 2000 + 5;
int n;
int a[2 * N];
int ind[2 * N];
bool mark[2 * N];
bool dp[N][2 * N];
vector<int> vec;
void solver() {
  vec.clear();
  memset(mark, 0, sizeof mark);
  memset(dp, 0, sizeof dp);
  memset(ind, 0, sizeof ind);
  cin >> n;
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
    ind[a[i] - 1] = i;
  }
  for (int i = 2 * n - 1; i >= 0; i--) {
    if (mark[ind[i]]) {
      continue;
    } else {
      int tmp = 0;
      for (int j = ind[i]; j < 2 * n; j++) {
        if (mark[j]) {
          break;
        }
        mark[j] = true;
        tmp++;
      }
      vec.push_back(tmp);
    }
  }
  dp[0][0] = true;
  for (int i = 1; i <= (int)vec.size(); i++) {
    dp[i][0] = true;
    for (int j = 1; j <= n; j++) {
      if (dp[i - 1][j]) {
        dp[i][j] = true;
      }
      if (vec[i - 1] <= j && dp[i - 1][j - vec[i - 1]]) {
        dp[i][j] = true;
      }
    }
  }
  int tmp = vec.size();
  if (dp[tmp][n]) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  long long t;
  cin >> t;
  for (long long i = 0; i < t; i++) {
    solver();
  }
}
