#include <bits/stdc++.h>
using namespace std;
long long int advceil(long long int num, long long int den) {
  return (num % den == 0 ? num / den : num / den + 1);
}
long long int lstbt(long long int val) {
  long long int msk = val & (val - 1);
  return log2(val ^ msk);
}
bool solve() {
  long long int n;
  cin >> n;
  long long int arr[100001];
  for (long long int i = 1; i <= 2 * n; i++) cin >> arr[i];
  vector<long long int> inc;
  inc.reserve(n + 3);
  long long int val = 0;
  inc.push_back(1);
  for (long long int i = 1; i <= 2 * n; i++) {
    if (arr[i] > val) inc.push_back(i), val = arr[i];
  }
  inc.push_back(2 * n + 1);
  long long int dp[10000] = {};
  dp[0] = true;
  for (long long int i = 0; i < inc.size() - 1; i++) {
    long long int reqspace = inc[i + 1] - inc[i];
    for (long long int i = n; i >= reqspace; i--)
      dp[i] = dp[i] || dp[i - reqspace];
  }
  return dp[n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--)
    if (solve())
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
}
