#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
bool compare(const pair<string, int> &a, const pair<string, int> &b) {
  return a.second < b.second;
}
double logn(double n, double r) { return (n > r - 1) ? 1 + logn(n / r, r) : 0; }
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> p(2 * n), len;
  for (long long int i = 0; i < 2 * n; i++) {
    cin >> p[i];
  }
  long long int cnt = 1, mx = p[0];
  for (long long int i = 1; i < 2 * n; i++) {
    if (p[i] > mx) {
      len.push_back(cnt);
      mx = p[i];
      cnt = 1;
    } else
      cnt++;
  }
  len.push_back(cnt);
  long long int dp[n + 1][len.size()];
  memset(dp, 0, sizeof dp);
  for (long long int i = 0; i < len.size(); i++) dp[0][i] = 1;
  for (long long int sum = 1; sum <= n; sum++) {
    for (long long int j = 1; j < len.size(); j++) {
      if (sum - len[j] >= 0) dp[sum][j] += dp[sum - len[j]][j - 1];
      dp[sum][j] += dp[sum][j - 1];
    }
  }
  if (dp[n][len.size() - 1]) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
}
int main() {
  int t = 1, k = 1;
  cin >> t;
  while (t--) {
    solve();
    k++;
  }
}
