#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int q;
  cin >> q;
  while (q--) {
    long long int i, j, k = 1, k1, n, m, x, y, c = 1, r, t, l2 = 0, r2, p = 0;
    cin >> n;
    long long int a[2 * n];
    m = 2 * n;
    for (i = 0; i < m; i++) cin >> a[i];
    vector<long long int> v;
    i = 0;
    while (i < m) {
      p = a[i];
      j = i + 1;
      c = 1;
      while (j < m && a[j] < p) {
        j++;
        c++;
      }
      i = j;
      v.push_back(c);
    }
    sort(v.begin(), v.end());
    x = v.size();
    long long int d[x + 1][n + 1];
    for (i = 0; i <= n; i++) d[0][i] = 0;
    for (i = 0; i <= x; i++) d[i][0] = 0;
    for (i = 1; i <= x; i++) {
      for (j = 1; j <= n; j++) {
        if (j < v[i - 1])
          d[i][j] = d[i - 1][j];
        else if (j == v[i - 1])
          d[i][j] = 1;
        else
          d[i][j] = max(d[i - 1][j - v[i - 1]], d[i - 1][j]);
      }
    }
    if (d[x][n] == 1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
