#include <bits/stdc++.h>
using namespace std;
const int N = 2005, inf = N << 1;
int n, cnt;
int a[N << 1], f[N];
int read() {
  int ret = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) ret = ret * 10 + (c ^ 48), c = getchar();
  return ret;
}
int main() {
  for (int T = read(); T; --T) {
    n = read();
    cnt = 0;
    for (int i = 1, len = 0, mx = 0; i <= 2 * n; ++i) {
      int now = read();
      if (now > mx)
        a[++cnt] = len, len = 1, mx = now;
      else
        ++len;
      if (i == 2 * n) a[++cnt] = len;
    }
    sort(a + 1, a + cnt + 1);
    f[0] = 1;
    for (int i = 1; i <= n; ++i) f[i] = 0;
    for (int i = 1; i <= cnt; ++i)
      for (int j = n; ~j; --j)
        if (f[j] && j + a[i] <= n) f[j + a[i]] = 1;
    puts(f[n] ? "YES" : "NO");
  }
  return 0;
}
