#include <bits/stdc++.h>
using namespace std;
long long int ways(long long int sum, long long int n,
                   vector<long long int> b) {
  bool nways[n + 1][sum + 1];
  for (long long int i = 0; i <= n; i++) nways[i][0] = true;
  for (long long int i = 1; i <= sum; i++) nways[0][i] = false;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = 1; j <= sum; j++) {
      if (j < b[i - 1]) nways[i][j] = nways[i - 1][j];
      if (j >= b[i - 1])
        nways[i][j] = nways[i - 1][j] || nways[i - 1][j - b[i - 1]];
    }
  }
  return nways[n][sum];
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, p[10005], count = 0, m = -1;
    cin >> n;
    vector<long long int> b;
    for (long long int i = 0; i < 2 * n; i++) cin >> p[i];
    m = p[0];
    for (long long int i = 0; i < 2 * n; i++) {
      if (p[i] <= m)
        count++;
      else {
        b.push_back(count);
        count = 1;
      }
      if (p[i] > m) m = p[i];
    }
    b.push_back(count);
    sort((b).begin(), (b).end());
    if (ways(n, b.size(), b) > 0)
      cout << "YES";
    else
      cout << "NO";
    cout << "\n";
  }
  return 0;
}
