#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mod = 1e9 + 7;
inline int bigmod(int B, int P) {
  int R = 1;
  while (P > 0) {
    if (P & 1) {
      R = (R * B) % mod;
    }
    P >>= 1;
    B = (B * B) % mod;
  }
  return R;
}
const int mxn = 2e5 + 10;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int tt = 1;
  cin >> tt;
  for (int tc = 1; tc <= tt; tc++) {
    int n;
    cin >> n;
    int ip[2 * n];
    int mx = 0;
    vector<int> len, ind;
    for (int i = 0; i < 2 * n; i++) {
      cin >> ip[i];
      if (ip[i] > mx) {
        mx = ip[i];
        ind.push_back(i + 1);
      }
    }
    for (int i = 1; i < (int)ind.size(); i++) {
      len.push_back(ind[i] - ind[i - 1]);
    }
    int si = len.size();
    bool dp[si + 1][n + 1];
    for (int i = 0; i <= si; i++) dp[i][0] = true;
    for (int i = 1; i <= n; i++) dp[0][i] = false;
    for (int i = 1; i <= si; i++) {
      for (int j = 1; j <= n; j++) {
        if (j < len[i - 1]) dp[i][j] = dp[i - 1][j];
        if (j >= len[i - 1])
          dp[i][j] = dp[i - 1][j] || dp[i - 1][j - len[i - 1]];
      }
    }
    cout << (dp[si][n] ? "YES\n" : "NO\n");
  }
  return 0;
}
