#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
int n, m;
int p[N];
int a[N];
int dp[N][2005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) cin >> p[i];
    int _max = p[1], last = 1;
    m = 0;
    for (int i = 2; i <= n * 2; i++) {
      if (p[i] > _max) {
        _max = p[i];
        a[++m] = i - last;
        last = i;
      }
    }
    a[++m] = 2 * n - last + 1;
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= n; j++) {
        dp[i][j] = 0;
      }
    }
    for (int i = 1; i <= m; i++) {
      dp[i][a[i]] = 1;
      for (int j = 1; j <= n; j++) {
        dp[i][j] |= dp[i - 1][j];
        if (j - a[i] >= 1) dp[i][j] |= dp[i - 1][j - a[i]];
      }
    }
    cout << (dp[m][n] ? "YES" : "NO") << '\n';
  }
  return 0;
}
