#include <bits/stdc++.h>
using namespace std;
bool findPartiion(vector<int> arr, int n) {
  int sum = 0;
  int i, j;
  for (i = 0; i < n; i++) sum += arr[i];
  if (sum % 2 != 0) return false;
  bool part[sum / 2 + 1][n + 1];
  for (i = 0; i <= n; i++) part[0][i] = true;
  for (i = 1; i <= sum / 2; i++) part[i][0] = false;
  for (i = 1; i <= sum / 2; i++) {
    for (j = 1; j <= n; j++) {
      part[i][j] = part[i][j - 1];
      if (i >= arr[j - 1])
        part[i][j] = part[i][j] || part[i - arr[j - 1]][j - 1];
    }
  }
  return part[sum / 2][n];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int array[2 * n];
    for (int i = 0; i < (2 * n); i++) {
      cin >> array[i];
    }
    vector<int> v;
    int count = 1;
    int curr = array[0];
    for (int i = 1; i < (2 * n); i++) {
      if (array[i] <= curr) {
        count++;
      } else {
        v.push_back(count);
        curr = array[i];
        count = 1;
      }
    }
    v.push_back(count);
    if (findPartiion(v, (int)v.size())) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
