#include <bits/stdc++.h>
using namespace std;
long long int solve() {
  long long int n;
  cin >> n;
  vector<bool> dp(2 * n + 1, 0);
  vector<long long int> p(2 * n);
  vector<long long int> nums;
  long long int cover = 0;
  vector<long long int> inv(2 * n + 1);
  for (long long int j = 0; j < 2 * n; j++) {
    cin >> p[j];
    inv[p[j]] = j;
    if (p[j] == 2 * n) {
      cover = j;
    }
  }
  nums.push_back(2 * n - cover);
  for (long long int j = 2 * n - 1; j >= 1; j--) {
    if (inv[j] > cover) {
      continue;
    } else {
      nums.push_back(cover - inv[j]);
      cover = inv[j];
    }
  }
  sort(nums.begin(), nums.end());
  dp[nums[0]] = 1;
  dp[0] = 1;
  long long int k = nums.size();
  for (long long int j = 1; j < k; j++) {
    vector<long long int> f(2 * n + 1, 0);
    for (long long int i = 0; i <= 2 * n; i++) {
      f[i] = dp[i];
      if (i - nums[j] >= 0) {
        f[i] = dp[i] || dp[i - nums[j]];
      }
    }
    for (long long int i = 0; i <= 2 * n; i++) {
      dp[i] = f[i];
    }
  }
  if (!dp[n]) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
