#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2, p) % p;
}
long long int n;
long long int a[4000];
vector<long long int> idx;
bool findSubsetSum() {
  vector<vector<bool>> dp(idx.size() + 1, vector<bool>(n + 1));
  for (long long int i = 1; i <= idx.size(); i++) {
    dp[i][0] = true;
    for (long long int sum = 1; sum <= n; sum++) {
      if (i != 0) {
        dp[i][sum] = dp[i - 1][sum];
        if (sum >= idx[i - 1])
          dp[i][sum] = dp[i - 1][sum] || dp[i - 1][sum - idx[i - 1]];
      }
    }
  }
  return dp[idx.size()][n];
}
void solve() {
  cin >> n;
  for (long long int i = 0; i < 2 * n; i++) cin >> a[i];
  long long int mx = 0, prev = -1;
  idx.clear();
  for (long long int i = 0; i < 2 * n; i++) {
    if (mx < a[i]) {
      if (i) idx.push_back(i - prev);
      mx = a[i];
      prev = i;
    }
  }
  idx.push_back(2 * n - prev);
  cout << (findSubsetSum() ? "YES\n" : "NO\n");
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
