#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(2 * n);
  for (long long int &i : a) {
    cin >> i;
  }
  vector<long long int> v;
  long long int i = 0;
  while (true) {
    if (i == 2 * n) {
      break;
    }
    long long int j = i;
    while (j < 2 * n && a[j] <= a[i]) {
      j++;
    }
    v.emplace_back(j - i);
    i = j;
  }
  long long int sum = accumulate((v).begin(), (v).end(), 0);
  sum /= 2;
  vector<vector<bool>> dp(v.size() + 1, vector<bool>(sum + 1));
  for (long long int i = 0; i <= v.size(); i++) {
    for (long long int j = 0; j <= sum; j++) {
      if (i == 0) {
        dp[i][j] = false;
        ;
      }
      if (j == 0) {
        dp[i][j] = true;
      }
    }
  }
  for (long long int i = 1; i <= v.size(); i++) {
    for (long long int j = 1; j <= sum; j++) {
      if (v[i - 1] <= j) {
        dp[i][j] = dp[i - 1][j] || dp[i - 1][j - v[i - 1]];
      } else {
        dp[i][j] = dp[i - 1][j];
      }
    }
  }
  cout << (dp[v.size()][sum] ? "YES" : "NO") << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
