#include <bits/stdc++.h>
const long long N = 3 * 1e5 + 5;
const long long MOD = 1000000007;
const long long MOD2 = 998244353;
const long long inf = 1e18;
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long a[2 * n];
  long long mx = -100;
  std::vector<long long> inds;
  for (long long i = 0; i < 2 * n; i++) {
    cin >> a[i];
    if (a[i] > mx) {
      inds.push_back(i + 1);
      mx = a[i];
    }
  }
  inds.push_back(2 * n + 1);
  std::vector<long long> lens;
  for (long long i = 1; i < inds.size(); i++) {
    lens.push_back(inds[i] - inds[i - 1]);
  }
  sort(lens.begin(), lens.end());
  long long m = lens.size();
  bool dp[m + 1][n + 1];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i <= m; i++) {
    dp[i][0] = true;
  }
  for (long long i = 1; i <= m; i++) {
    for (long long j = 1; j <= n; j++) {
      if (j < lens[i - 1]) {
        dp[i][j] = dp[i - 1][j];
      } else {
        dp[i][j] = dp[i - 1][j] or dp[i - 1][j - lens[i - 1]];
      }
    }
  }
  if (dp[m][n])
    cout << "Yes\n";
  else
    cout << "No\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long t = 1;
  cin >> t;
  long long ctr = 0;
  while (t--) {
    ctr++;
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
