#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> arr(2 * n);
  for (int c = 0; c < 2 * n; c++) cin >> arr[c];
  vector<int> parts;
  int last = 2 * n - 1;
  while (last >= 0) {
    int index = 0;
    for (int c1 = 1; c1 <= last; c1++) {
      if (arr[c1] > arr[index]) index = c1;
    }
    parts.push_back(last - index + 1);
    last = index - 1;
  }
  bool dp[4001][2001] = {0};
  int ans = 0;
  dp[0][parts[0]] = 1;
  dp[0][0] = 1;
  for (int c = 1; c < parts.size(); c++) {
    for (int c1 = 0; c1 <= n; c1++) {
      if (c1 >= parts[c])
        dp[c][c1] = (dp[c - 1][c1] || dp[c - 1][c1 - parts[c]]);
      else
        dp[c][c1] = dp[c - 1][c1];
    }
    if (dp[c][n] == 1) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  for (; t > 0; t--) {
    solve();
  }
  return 0;
}
