#include <bits/stdc++.h>
const int N = 1000005;
using namespace std;
long long n, k, sum, q, res, m, val, ans;
long long x, y;
double p;
long long xx[] = {1, 0, -1, 0};
long long yy[] = {0, 1, 0, -1};
void solve() {
  cin >> n;
  vector<int> v(2 * n);
  for (int i = 0; i < 2 * n; i++) cin >> v[i];
  vector<int> v1;
  for (int i = 0; i < 2 * n;) {
    int j = i + 1;
    int len = 1;
    while (j < 2 * n and v[j] < v[i]) {
      j++;
      len++;
    }
    v1.push_back(len);
    i = j;
  }
  m = v1.size();
  int dp[m][n + 1];
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  dp[0][v1[0]] = 1;
  for (int i = 1; i < m; i++) {
    dp[i][0] = 1;
    for (int w = 1; w <= n; w++) {
      dp[i][w] = dp[i - 1][w];
      if (w >= v1[i]) dp[i][w] |= dp[i - 1][w - v1[i]];
    }
  }
  if (dp[m - 1][n])
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long i = 1; i <= t; i++) solve();
}
