#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int T, n, m, g[2 * N];
bool f[2 * N];
int main() {
  f[0] = true;
  scanf("%d", &T);
  while (T--) {
    m = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) f[i] = false;
    for (int x, s = 0, i = 1, j = 1; i <= 2 * n; ++i) {
      scanf("%d", &x);
      if (x > s) {
        s = x;
        g[++m] = i - j;
        j = i;
      }
      if (i == 2 * n) g[++m] = 2 * n + 1 - j;
    }
    for (int i = 1; i <= m; ++i)
      for (int j = n; j >= g[i]; --j) f[j] |= f[j - g[i]];
    puts(f[n] ? "YES" : "NO");
  }
}
