#include <bits/stdc++.h>
using namespace std;
int arr[5000], dp[5000][2100], n;
int solve(vector<int> &v, int sum, int n) {
  for (int i = 0; i <= n; i++) dp[i][0] = 1;
  for (int i = 1; i <= sum; i++) dp[0][i] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < v[i - 1]) dp[i][j] = dp[i - 1][j];
      if (j >= v[i - 1]) dp[i][j] = dp[i - 1][j] || dp[i - 1][j - v[i - 1]];
    }
  }
  return dp[n][sum];
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> arr[i];
    }
    vector<int> v;
    int k = 1;
    int c = arr[1];
    for (int i = 2; i <= 2 * n; i++) {
      if (arr[i] < c) {
        k++;
      } else {
        v.push_back(k);
        k = 1;
      }
      c = max(c, arr[i]);
    }
    v.push_back(k);
    sort(v.begin(), v.end());
    int nn = v.size();
    if (solve(v, n, nn) == 1) {
      cout << "YES"
           << "\n";
    } else {
      cout << "NO"
           << "\n";
    }
  }
}
