#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
const int inf = 2e9;
const int mode = 998244353;
int n;
int a[N], b[N], f[N];
void solve() {
  cin >> n;
  int slt = 0;
  for (int i = 1; i <= 2 * n; i++) cin >> a[i], b[i] = 0;
  for (int i = 1; i <= 2 * n; i++) {
    int u = i;
    for (int j = i + 1; j <= 2 * n; j++)
      if (a[j] < a[i])
        u = j;
      else
        break;
    b[++slt] = u - i + 1;
    i = u;
  }
  sort(b + 1, b + slt + 1);
  for (int i = 0; i <= 2 * n; i++) f[i] = 0;
  f[0] = 1;
  for (int i = 1; i <= slt; i++)
    for (int s = 2 * n; s >= b[i]; s--)
      if (f[s] == 0) f[s] = f[s - b[i]];
  cout << ((f[n]) ? "YES" : "NO") << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int ntest;
  cin >> ntest;
  while (ntest--) solve();
}
