#include <bits/stdc++.h>
using namespace std;
int n, p[4090];
int v[4090], w[4090], m, dp[2090];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    m = 0;
    scanf("%d", &n);
    for (int i = 1; i <= 2 * n; ++i) scanf("%d", &p[i]);
    int k = 1, u = p[1];
    for (int i = 2; i <= 2 * n; ++i) {
      if (p[i] > u) {
        w[++m] = k;
        v[m] = k;
        k = 1;
        u = p[i];
      } else
        k++;
    }
    v[++m] = k;
    w[m] = k;
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= m; ++i) {
      for (int V = n; V >= v[i]; --V) {
        dp[V] = max(dp[V], dp[V - v[i]] + w[i]);
      }
    }
    if (dp[n] == n)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
