#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
  long long x = 0, flg = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') flg = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * flg;
}
int t, n;
int a[4010], b[4010], top, vis[4010], pos[4010], f[4010][4010];
int main() {
  t = rd();
  while (t--) {
    n = rd();
    int cnt = 0;
    top = 0;
    for (register int i = 1; i <= 2 * n; ++i) vis[i] = pos[i] = 0;
    for (register int i = 1; i <= n; ++i)
      for (register int j = 1; j <= n; ++j) f[i][j] = 0;
    for (register int i = 1; i <= 2 * n; ++i) a[i] = rd(), pos[a[i]] = i;
    for (register int i = 2 * n; i >= 1; --i) {
      cnt = 0;
      for (register int j = pos[i]; j <= 2 * n && !vis[j]; ++j)
        cnt++, vis[j] = 1;
      if (cnt) b[++top] = cnt;
    }
    f[0][0] = 1;
    for (register int i = 1; i <= top; ++i) {
      for (register int j = 0; j <= n; ++j) {
        if (f[i - 1][j]) {
          f[i][j] = 1;
          if (j + b[i] <= n) f[i][j + b[i]] = 1;
        }
      }
    }
    if (f[top][n])
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
