#include <bits/stdc++.h>
using namespace std;
bool comparator(pair<long long, long long>& p1,
                pair<long long, long long>& p2) {
  return p1.first > p2.first;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> A(2 * n);
    vector<int> B(2 * n + 1);
    for (int i = 0; i < 2 * n; i++) {
      cin >> A[i];
      if (i == 0) {
        B[i] = A[i];
      } else {
        B[i] = max(A[i], B[i - 1]);
      }
    }
    B[0] = A[0];
    B[2 * n] = -1;
    vector<int> C;
    int prev = -1;
    for (int i = 1; i < 2 * n + 1; i++) {
      if (B[i] != B[i - 1]) {
        C.push_back(i - 1 - prev);
        prev = i - 1;
      }
    }
    int m = C.size();
    vector<vector<bool>> dp(m + 1, vector<bool>(n + 1, false));
    for (int i = 0; i <= m; i++) {
      dp[i][0] = true;
    }
    dp[0][0] = true;
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= n; j++) {
        if (j < C[i - 1]) {
          dp[i][j] = dp[i - 1][j];
        } else {
          if (dp[i - 1][j] || dp[i - 1][j - C[i - 1]]) {
            dp[i][j] = true;
          }
        }
      }
    }
    if (dp[m][n] == true) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
