#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long a[2 * n];
  for (long long i = 0; i < 2 * n; i++) cin >> a[i];
  vector<long long> diff, v;
  long long mx = -1;
  for (long long i = 0; i < 2 * n; i++) {
    if (a[i] > mx) {
      mx = a[i];
      v.push_back(i);
    }
  }
  v.push_back(2 * n);
  for (long long i = 1; i < v.size(); i++) diff.push_back(v[i] - v[i - 1]);
  sort(diff.begin(), diff.end());
  long long m = diff.size();
  bool dp[m + 1][n + 1];
  for (int i = 0; i <= m; i++) dp[i][0] = true;
  for (int i = 1; i <= n; i++) dp[0][i] = false;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      if (j < diff[i - 1])
        dp[i][j] = dp[i - 1][j];
      else
        dp[i][j] = dp[i - 1][j] || dp[i - 1][j - diff[i - 1]];
    }
  }
  dp[m][n] == 1 ? cout << "YES"
                       << "\n"
                : cout << "NO"
                       << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
