#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC optimization("O3")
using namespace std;
const unsigned long long mod = 1000000007;
const long long inf = ((1ll << 31ll) - 1ll);
const long double pi = acos(-1);
const long long MAXN = 1000000;
vector<long long> Criba(MAXN + 1);
void iniciar_criba() {
  for (long long i = 2; i <= MAXN; i += 2) Criba[i] = 2;
  for (long long i = 3; i <= MAXN; i += 2) {
    if (!Criba[i]) {
      Criba[i] = i;
      for (long long j = i * i; j <= MAXN; j += (2 * i))
        if (!Criba[j]) Criba[j] = i;
    }
  }
}
bool isprime(long long tupac) { return (Criba[tupac] == tupac); }
long long GCD(long long q, long long r) {
  if (r == 0) return q;
  return GCD(r, q % r);
}
long long LCM(long long q, long long r) { return q * (r / GCD(q, r)); }
long long qpow(long long b, long long e) {
  if (!e) return 1;
  if (e & 1) return qpow(b, e - 1) * b % mod;
  long long pwur = qpow(b, e >> 1);
  return pwur * pwur % mod;
}
long long InverM(long long a, long long b) {
  long long eso = a - (a / b) * b;
  if (eso == 0) return 0;
  long long ans = (1 - b * InverM(b, eso)) / eso;
  if (ans < 0) ans += b;
  return ans;
}
long long t, n, m, k, Fac[250007], lB, rB;
vector<long long> bult;
bool Flag[1007];
long long dp[4007][2007];
long long mochila(long long i, long long libre) {
  if (libre < 0) return -100000000;
  if (i == 0) return 0;
  if (dp[i][libre] != -1) return dp[i][libre];
  long long opcion1 = mochila(i - 1, libre);
  long long opcion2 = bult[i] + mochila(i - 1, libre - bult[i]);
  return (dp[i][libre] = max(opcion1, opcion2));
}
void problem() {
  long long A[20007];
  cin >> n;
  bult.resize(0);
  for (long long i = 1; i <= 2 * n; i++) {
    cin >> A[i];
  }
  long long cont = 0, Max = 0;
  for (long long i = 1; i <= 2 * n; i++) {
    if (A[i] > Max) {
      Max = A[i];
      bult.push_back(cont);
      cont = 1;
    } else {
      cont++;
    }
  }
  bult.push_back(cont);
  sort(bult.begin(), bult.end());
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= 2 * n; j++) {
      dp[j][i] = -1;
    }
  }
  long long solucion = mochila(bult.size() - 1, n);
  if (solucion == n)
    cout << "YES";
  else
    cout << "NO";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(0);
  srand(time(NULL));
  cin >> t;
  while (t--) {
    problem();
    cout << '\n';
  }
  return 0;
}
