#include <bits/stdc++.h>
using namespace std;
long long v[4005];
bool dp[4005][2005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long tc;
  cin >> tc;
  while (tc--) {
    long long n;
    cin >> n;
    for (long long int i = 0; i < 2 * n; i++) {
      cin >> v[i];
    }
    vector<long long int> comps;
    long long idx = 0;
    while (1) {
      if (idx == 2 * n) break;
      long long compSize = 1, x = idx + 1;
      while (x < 2 * n && v[x] < v[idx]) {
        compSize++;
        x++;
      }
      comps.push_back(compSize);
      idx = x;
    }
    for (long long int i = 0; i < comps.size() + 1; i++) {
      dp[i][0] = 1;
    }
    for (long long int i = 1; i < n + 1; i++) {
      dp[0][i] = 0;
    }
    for (long long int i = 1; i < (long long)comps.size() + 1; i++) {
      for (long long int j = 1; j < n + 1; j++) {
        if (j < comps[i - 1]) {
          dp[i][j] = dp[i - 1][j];
        }
        if (j >= comps[i - 1]) {
          dp[i][j] = dp[i - 1][j] || dp[i - 1][j - comps[i - 1]];
        }
      }
    }
    if (dp[(long long)comps.size()][n] == 1) {
      cout << "YES"
           << "\n";
    } else {
      cout << "NO"
           << "\n";
    }
  }
  return 0;
}
