#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
A cvt(B x) {
  stringstream ss;
  ss << x;
  A y;
  ss >> y;
  return y;
}
int n;
int p[4009];
int nxt[4009];
int f[4009][8009];
int solve(int i, int d) {
  if (i == 2 * n) return d == 0;
  int &r = f[i][2 * n + d];
  if (r != -1) return r;
  r = 0;
  int j = nxt[i];
  d -= j - i;
  if (solve(j, d) || solve(j, -d)) r = 1;
  return r;
}
int main() {
  int tests;
  cin >> tests;
  for (int test = 0; test < (int)(tests); test++) {
    cin >> n;
    for (int i = 0; i < (int)(2 * n); i++) cin >> p[i];
    p[2 * n] = 1e9;
    for (int i = 0; i < (int)(2 * n); i++) {
      int j = i + 1;
      while (j < 2 * n && p[j] < p[i]) j++;
      nxt[i] = j;
    }
    for (int i = 0; i < (int)(2 * n + 1); i++)
      for (int d = 0; d < (int)(4 * n + 1); d++) f[i][d] = -1;
    if (solve(0, 0))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
