#include <bits/stdc++.h>
using namespace std;
const int64_t INF = (int64_t)(2e18);
const int inf = (int)(1e9 + 7);
const int maxn = 5005;
int inds[maxn];
int vec[maxn];
int here[maxn];
int s[maxn];
int sm[maxn];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < 2 * n; ++i) cin >> vec[i];
  fill(here, here + 2 * n, 1);
  fill(s, s + 2 * n, 1);
  fill(sm, sm + maxn, 0);
  sm[0] = 1;
  while (true) {
    int cnt = 0;
    for (int i = 0; i < 2 * n; ++i) {
      inds[cnt] = i;
      cnt += here[i];
    }
    bool flag = false;
    for (int i = 0; i < cnt - 1; ++i) {
      if (vec[inds[i]] > vec[inds[i + 1]]) {
        here[inds[i + 1]] = 0;
        s[inds[i]] += s[inds[i + 1]];
        s[inds[i + 1]] = 0;
        flag = true;
        break;
      }
    }
    if (!flag) break;
  }
  for (int i = 0; i < 2 * n; ++i) {
    if (here[i] == 0) continue;
    for (int j = 2005; j >= 0; --j) {
      sm[j + s[i]] |= sm[j];
    }
  }
  if (sm[n])
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
