#include <bits/stdc++.h>
using namespace std;
bool dp[(long long)1e5];
void solve() {
  long long n;
  cin >> n;
  deque<long long> a;
  for (long long i = 1; i <= n * 2; i++) {
    long long x;
    cin >> x;
    a.push_back(x);
  }
  vector<long long> blocks;
  while ((long long)a.size()) {
    long long x = a.front();
    a.pop_front();
    long long hugs = 1;
    while ((long long)a.size() and a.front() < x) {
      hugs++;
      a.pop_front();
    }
    blocks.emplace_back(hugs);
  }
  for (long long i = 1; i <= 4500; i++) dp[i] = false;
  dp[0] = true;
  for (long long x : blocks) {
    for (long long i = 2000; i >= 0; i--) {
      if (dp[i]) dp[i + x] = true;
    }
  }
  string ans = "NO";
  if (dp[n]) ans = "YES";
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(0);
  cin.sync_with_stdio(0);
  cin.tie(0);
  long long t;
  cin >> t;
  while (t--) solve();
}
