#include <bits/stdc++.h>
using namespace std;
long long n;
long long ar[200050];
long long dp[200050];
void solve() {
  cin >> n;
  n += n;
  for (long long i = 0; i < n; i++) {
    cin >> ar[i];
  }
  long long r = n - 1;
  vector<long long> val;
  while (r >= 0) {
    long long ma = 0;
    for (long long j = 0; j <= r; j++) {
      if (ar[j] > ar[ma]) ma = j;
    }
    val.push_back(r - ma + 1);
    r = ma - 1;
  }
  for (long long i = 0; i <= n; i++) dp[i] = 0;
  dp[0] = 1;
  for (auto j : val) {
    for (long long i = n; i >= 0; i--) {
      if (dp[i]) dp[i + j] = 1;
    }
  }
  if (dp[n / 2])
    cout << "YES";
  else
    cout << "NO";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
    cout << '\n';
  }
  return 0;
}
