#include <bits/stdc++.h>
using namespace std;
int m[300100], f[300100], ans[300100];
int main() {
  int t, i, n, num, cnt, j;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    memset(f, 0, sizeof(f));
    m[0] = 999999999;
    cnt = 0;
    num = 0;
    for (i = 1; i <= 2 * n; i++) {
      scanf("%d", &m[i]);
    }
    j = 1;
    for (i = 1; i <= 2 * n; i++) {
      if (m[i] > m[j]) {
        ans[++cnt] = i - j;
        j = i;
      }
    }
    if (cnt != 0) ans[++cnt] = i - j;
    f[0] = 1;
    for (i = 1; i <= cnt; i++) {
      for (j = n; j >= 0; j = j - 1) {
        if (f[j] == 1) {
          f[j + ans[i]] = 1;
        }
      }
    }
    if (f[n] == 1) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
}
