#include <bits/stdc++.h>
using namespace std;
int n, m, dp[4001][2001], br[4001];
int solve(int i, int rq) {
  if (i > m) {
    if (rq == 0) {
      return 1;
    } else {
      return 0;
    }
  }
  if (dp[i][rq] != -1) {
    return dp[i][rq];
  }
  bool ans = solve(i + 1, rq);
  if (br[i] <= rq) {
    ans |= solve(i + 1, rq - br[i]);
  }
  return dp[i][rq] = ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    int ar[2 * n + 1], pre[2 * n + 1];
    pre[0] = INT_MIN;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> ar[i];
      pre[i] = max(pre[i - 1], ar[i]);
    }
    vector<int> tmp;
    int lm = 2 * n + 1;
    int j = 1;
    for (int i = 2 * n; i >= 1; i--) {
      if (ar[i] == pre[i]) {
        br[j++] = (lm - 1 - i + 1);
        lm = i;
      }
    }
    m = j - 1;
    for (int i = 0; i <= m; i++) {
      for (int j = 0; j <= n; j++) {
        dp[i][j] = -1;
      }
    }
    if (solve(1, n)) {
      cout << "YES" << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
  return 0;
}
