#include <bits/stdc++.h>
using namespace std;
const long long int MAXN = 5e5 + 5;
const long long int mod = 1e9 + 7;
const long double pi = 3.141592653;
long long int a[4015];
long long int dp[4015][4015];
void solve() {
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n + 5; i++) {
    for (long long int j = 0; j < 2 * n + 5; j++) dp[i][j] = 0;
  }
  for (long long int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  vector<long long int> v, len;
  long long int mx = 0;
  for (long long int i = 0; i < 2 * n; i++) {
    if (a[i] > mx) {
      v.push_back(i);
      mx = a[i];
    }
  }
  v.push_back(2 * n);
  len.push_back(0);
  for (long long int i = (long long int)v.size() - 2; i >= 0; i--) {
    len.push_back(v[i + 1] - v[i]);
  }
  dp[0][0] = 1;
  for (long long int i = 1; i < (long long int)len.size(); i++) {
    dp[i][len[i]] = 1;
    for (long long int j = 0; j < 2 * n + 5; j++) {
      dp[i][j] = dp[i - 1][j];
      if (j - len[i] >= 0 && dp[i - 1][j - len[i]] == 1) {
        dp[i][j] = 1;
      }
    }
  }
  for (long long int i = 1; i < (long long int)len.size(); i++) {
    if (dp[i][n] == 1) {
      cout << "YES\n";
      return;
    }
  }
  cout << "NO\n";
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  cin >> t;
  while (t--) solve();
  cerr << "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << "ms"
       << '\n';
  return 0;
}
