#include <bits/stdc++.h>
using namespace std;
int main() {
  int tc;
  cin >> tc;
  while (tc--) {
    int n;
    cin >> n;
    vector<int> parts;
    int arr[2 * n];
    for (int i = 0; i < 2 * n; i++) {
      cin >> arr[i];
    }
    int curr = 0;
    int low, high;
    for (int i = 0; i < 2 * n; i++) {
      if (arr[i] > arr[curr]) {
        parts.push_back(i - curr);
        curr = i;
      }
    }
    int s = 2 * n;
    for (int x : parts) s -= x;
    parts.push_back(s);
    bool sum[2 * n];
    for (int i = 0; i < 2 * n; i++) sum[i] = false;
    sum[0] = true;
    for (int x : parts) {
      for (int i = 2 * n - 1; i >= 0; i--) {
        if (i - x >= 0) {
          sum[i] = sum[i] | sum[i - x];
        }
      }
    }
    if (sum[n]) {
      printf("YES\n");
    } else {
      printf("NO\n");
    }
  }
}
