#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 1000001;
const int maxN = 1e6 + 7;
void solve(vector<int>& sizes, int n) {
  int dp[sizes.size() + 1][n + 1];
  memset(dp, 0, sizeof(dp));
  dp[0][0] = true;
  for (int i = 1; i <= sizes.size(); i++) {
    for (int j = 0; j <= n; j++) {
      if (j - sizes[i - 1] >= 0) {
        dp[i][j] = dp[i - 1][j] || dp[i - 1][j - sizes[i - 1]];
      } else {
        dp[i][j] = dp[i - 1][j];
      }
    }
  }
  if (dp[sizes.size()][n]) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) {
    int n;
    cin >> n;
    vector<int> p(2 * n, 0);
    for (int i = 0; i < 2 * n; i++) {
      cin >> p[i];
    }
    vector<int> sizes;
    int len = 1;
    int last = p[0];
    for (int i = 1; i < 2 * n; i++) {
      if (p[i] > last) {
        sizes.push_back(len);
        last = p[i];
        len = 1;
      } else {
        len++;
      }
    }
    sizes.push_back(len);
    solve(sizes, n);
  }
  return 0;
}
