#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> v;
    for (int i = 0; i < 2 * n; i++) {
      int x;
      cin >> x;
      v.push_back(x);
    }
    vector<int> rep;
    int cnt = 1;
    int prev = v[0];
    for (int i = 1; i < v.size(); i++) {
      if (v[i] > prev) {
        rep.push_back(cnt);
        prev = v[i];
        cnt = 1;
      } else {
        cnt++;
      }
    }
    rep.push_back(cnt);
    int dp[rep.size() + 1][n + 1];
    for (int i = 0; i <= rep.size(); i++) {
      dp[i][0] = 1;
    }
    for (int j = 1; j <= n; j++) {
      dp[0][j] = 0;
    }
    for (int i = 1; i <= rep.size(); i++) {
      for (int j = 1; j <= n; j++) {
        if (j < rep[i - 1]) {
          dp[i][j] = dp[i - 1][j];
        } else {
          dp[i][j] = dp[i - 1][j] || dp[i - 1][j - rep[i - 1]];
        }
      }
    }
    if (dp[rep.size()][n])
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
