#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const int maxn = 1e6 + 7;
string solve() {
  int n;
  cin >> n;
  vector<int> a(2 * n);
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  vector<int> grps;
  int i = 0;
  while (i < 2 * n) {
    int j = i;
    while (j < 2 * n && a[i] >= a[j]) {
      j++;
    }
    int len = j - i;
    grps.push_back(len);
    i = j;
  }
  vector<vector<bool>> dp(2 * n + 10, vector<bool>(2 * n + 10, false));
  int sz = (int)grps.size();
  for (int i = 0; i <= sz; i++) {
    dp[0][i] = true;
  }
  for (int i = 1; i <= n; i++) {
    dp[i][0] = false;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sz; j++) {
      dp[i][j] = dp[i][j - 1];
      if (i >= grps[j - 1]) {
        dp[i][j] = (dp[i][j] || dp[i - grps[j - 1]][j - 1]);
      }
    }
  }
  if (dp[n][sz] == true) return "YES";
  return "NO";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) {
    cout << solve() << "\n";
  }
  return 0;
}
