#include <bits/stdc++.h>
using namespace std;
int dp[2001][4000];
int f(vector<int> x, int sum, int i, int l, int dp[2001][4000]) {
  if (dp[sum][i] != -1) return false;
  if (sum == 0) return true;
  if (i == l - 1) {
    if (sum - x[i] == 0)
      return true;
    else {
      dp[sum][i] = 0;
      return false;
    }
  }
  if (sum - x[i] >= 0) {
    if (f(x, sum - x[i], i + 1, l, dp) == true) return true;
  }
  if (f(x, sum, i + 1, l, dp) == true) return true;
  dp[sum][i] = 0;
  return false;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[2 * n];
    vector<int> x;
    for (int i = 0; i < 2 * n; i++) {
      cin >> a[i];
    }
    int maxi = a[0];
    int c = 1;
    for (int i = 1; i < 2 * n; i++) {
      if (a[i] < maxi)
        c++;
      else {
        x.push_back(c);
        maxi = a[i];
        c = 1;
      }
    }
    x.push_back(c);
    int l = x.size();
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j < l; j++) {
        dp[i][j] = -1;
      }
    }
    if (f(x, n, 0, l, dp) == true)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
