#include <bits/stdc++.h>
using namespace std;
int n;
int a[4005], p[4005], b[4005], f[4005];
int main() {
  int T;
  cin >> T;
  while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= n * 2; i++) scanf("%d", &a[i]), p[a[i]] = i, f[i] = 0;
    int now = n * 2 + 1, cnt = 0;
    for (int i = n * 2; i >= 1; i--) {
      if (p[i] < now) b[++cnt] = now - p[i], now = p[i];
    }
    f[0] = 1;
    for (int i = 1; i <= cnt; i++) {
      for (int j = n * 2; j >= b[i]; j--) {
        f[j] |= f[j - b[i]];
      }
    }
    if (f[n])
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
