#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000007];
int pos[1000007];
int f[1000007];
vector<int> p;
void work() {
  memset(f, 0, sizeof(f));
  p.clear();
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; i++) {
    scanf("%d", &a[i]);
    pos[a[i]] = i;
  }
  int minn = 2 * n + 1;
  for (int i = 2 * n; i > 0; i--) {
    if (pos[i] < minn) {
      p.push_back(minn - pos[i]);
      minn = pos[i];
    }
  }
  f[0] = 1;
  for (auto y : p) {
    for (int i = n; i >= y; i--) {
      f[i] |= f[i - y];
    }
  }
  if (f[n]) {
    puts("YES");
  } else {
    puts("NO");
  }
  return;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    work();
  }
  return 0;
}
