#include <bits/stdc++.h>
using namespace std;
const long long N = 4005;
long long n, a[N];
void solve() {
  cin >> n;
  for (long long i = 1; i <= 2 * n; i++) cin >> a[i];
  vector<long long> len;
  for (long long i = 1, prv = a[1], l = 0; i <= 2 * n; i++) {
    if (a[i] <= prv)
      l++;
    else {
      len.push_back(l);
      l = 1;
      prv = a[i];
    }
  }
  vector<long long> dp(n + 1, 0);
  dp[0] = 1;
  for (auto &l : len) {
    for (long long i = n; i >= l; i--) dp[i] |= dp[i - l];
  }
  cout << (dp[n] ? "YES" : "NO") << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) solve();
}
