#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vvi = vector<vector<int> >;
using vvl = vector<vector<ll> >;
using vpi = vector<pair<int, int> >;
using vpl = vector<pair<ll, ll> >;
const int MOD = 1e9 + 7;
ll mod(ll a, ll b) {
  ll c = ((a % b) + b) % b;
  return c;
}
ll binpow(ll a, ll n) {
  ll p, q, r;
  if (n == 0)
    return 1;
  else if (n % 2 == 0) {
    p = binpow(a, n / 2);
    r = p * p;
    q = mod(r, MOD);
    return q;
  } else {
    p = binpow(a, n / 2);
    r = p * p;
    q = mod(r, MOD);
    r = a * q;
    q = mod(r, MOD);
    return q;
  }
}
void sieve(vi& prime, vi& spf) {
  int n = prime.size() - 1;
  for (int i = 1; i <= n; i++) {
    prime[i] = 1;
    spf[i] = i;
  }
  prime[1] = 0;
  for (int i = 2; i <= sqrt(n); i++) {
    if (prime[i] == 1) {
      for (int j = 2; i * j <= n; j++) {
        prime[i * j] = 0;
        if (spf[i * j] == i * j) spf[i * j] = i;
      }
    }
  }
}
ll dg, xg, yg;
void extendedEuclid(ll a, ll b) {
  ll temp;
  if (b == 0) {
    dg = a;
    xg = 1;
    yg = 0;
  } else {
    extendedEuclid(b, a % b);
    temp = xg;
    xg = yg;
    yg = temp - (a / b) * yg;
  }
}
ll mod_mul_inv(ll a, ll m) {
  extendedEuclid(a, m);
  return mod(xg, m);
}
bool isSubsetSum(vi& set, int n, int sum) {
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (int i = 1; i <= sum; i++) subset[0][i] = false;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < set[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= set[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]];
    }
  }
  return subset[n][sum];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  ll t, n;
  cin >> t;
  while (t--) {
    cin >> n;
    vi a(2 * n);
    for (int i = 0; i < 2 * n; i++) cin >> a[i];
    vvi vec;
    int j, k;
    for (j = 0; j < 2 * n; j++) {
      vi v;
      int cur = a[j];
      for (k = j + 1; k < 2 * n; k++) {
        if (a[k] < cur && k == j + 1) {
          v.push_back(cur);
          v.push_back(a[k]);
        } else if (a[k] < cur)
          v.push_back(a[k]);
        else
          break;
      }
      if (!v.empty()) vec.push_back(v);
      j = k - 1;
    }
    vvi fin;
    int x, bb;
    for (x = 0; x < vec.size(); x++) {
      vi aa = vec[x];
      int cc = vec[x][0];
      for (bb = x + 1; bb < vec.size(); bb++) {
        if (vec[bb][0] < cc) {
          for (auto it : vec[bb]) aa.push_back(it);
        } else
          break;
      }
      fin.push_back(aa);
      x = bb - 1;
    }
    vi ss;
    for (int e = 0; e < fin.size(); e++) ss.push_back(int((fin[e]).size()));
    int sum = 0;
    for (auto it : ss) sum += it;
    for (int j = sum; j < 2 * n; j++) ss.push_back(1);
    sort((ss).begin(), (ss).end());
    if (isSubsetSum(ss, int((ss).size()), n))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
