#include <bits/stdc++.h>
using namespace std;
int a[4005];
bool f[4005][2005];
int seg[4005];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int mx = 0;
    int cursz = 0;
    int cnt = 1;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> a[i];
      if (mx == 0) {
        mx = a[i];
        cursz = 1;
      } else {
        if (a[i] > mx) {
          seg[cnt] = cursz;
          cursz = 1;
          cnt++;
          mx = a[i];
        } else {
          cursz++;
        }
      }
      for (int j = 0; j <= n; j++) f[i][j] = 0;
    }
    f[0][0] = 1;
    if (cursz > 0) seg[cnt] = cursz;
    for (int i = 1; i <= cnt; i++) {
      for (int j = 0; j <= n; j++) {
        f[i][j] = max(f[i][j], f[i - 1][j]);
        if (j >= seg[i]) f[i][j] = max(f[i][j], f[i - 1][j - seg[i]]);
      }
    }
    if (f[cnt][n])
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
