#include <bits/stdc++.h>
using namespace std;
void sol() {
  long long n;
  cin >> n;
  vector<long long> arr(2 * n);
  for (auto &x : arr) {
    cin >> x;
  }
  vector<long long> boba;
  long long val = 1;
  long long prev = arr[0];
  for (long long i = 1; i < 2 * n; i++) {
    if (arr[i] > prev) {
      boba.push_back(val);
      val = 1;
      prev = arr[i];
    } else {
      val++;
    }
  }
  boba.push_back(val);
  long long m = boba.size();
  vector<vector<bool>> dp(m + 1, vector<bool>(n + 1, false));
  dp[0][0] = true;
  for (long long i = 1; i <= m; i++) {
    for (long long j = 0; j <= n; j++) {
      if (dp[i - 1][j]) {
        dp[i][j] = true;
      }
      if (boba[i - 1] <= j) {
        if (dp[i - 1][j - boba[i - 1]]) {
          dp[i][j] = true;
        }
      }
    }
  }
  cout << (dp[m][n] ? "YES\n" : "NO\n");
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long t = 1;
  cin >> t;
  while (t--) {
    sol();
  }
}
