#include <bits/stdc++.h>
using namespace std;
const int maxn = 5009;
int Tn;
int n;
int a[maxn];
int q[maxn], nn;
int f[maxn];
int main() {
  scanf("%d", &Tn);
  while (Tn--) {
    scanf("%d", &n);
    n <<= 1;
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    int r, nn = 0;
    for (int i = 1; i <= n; i = r + 1) {
      r = i;
      while (r + 1 <= n && a[r + 1] < a[i]) ++r;
      q[++nn] = r - i + 1;
    }
    memset(f, 0, sizeof(f));
    f[0] = 1;
    for (int i = 1; i <= nn; ++i) {
      int x = q[i];
      for (int j = n; j >= x; --j) {
        f[j] |= f[j - x];
      }
    }
    if (f[n / 2])
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
