#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e3 + 5;
int arr[MAXN];
bool dp[MAXN][MAXN];
vector<int> v1;
bool isSubsetSum(int n, int sum) {
  for (int i = 0; i <= n + 1; i++) {
    for (int j = 0; j <= sum + 1; j++) {
      dp[i][j] = false;
    }
  }
  for (int i = 0; i <= n; i++) dp[i][0] = true;
  for (int i = 1; i <= sum; i++) {
    dp[0][i] = false;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < v1[i - 1]) dp[i][j] = dp[i - 1][j];
      if (j >= v1[i - 1]) dp[i][j] = dp[i - 1][j] || dp[i - 1][j - v1[i - 1]];
    }
  }
  return dp[n][sum];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    v1.clear();
    for (int i = 1; i <= 2 * n; i++) {
      cin >> arr[i];
    }
    v1.push_back(0);
    for (int i = 1; i <= 2 * n; i++) {
      int hold = (2 * n) + 1;
      for (int j = i + 1; j <= 2 * n; j++) {
        if (arr[j] > arr[i]) {
          hold = j;
          break;
        }
      }
      v1.push_back(hold - i);
      if (hold == (2 * n) + 1) {
        break;
      }
      i = hold - 1;
    }
    int sz = v1.size();
    if (isSubsetSum(sz - 1, n)) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
