#include <bits/stdc++.h>
using namespace std;
bool subset_exists_recur(vector<int> &set, long long sum, int n) {
  bool subset[n + 1][sum + 1];
  for (int i = 0; i <= n; i++) subset[i][0] = true;
  for (int i = 1; i <= sum; i++) subset[0][i] = false;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= sum; j++) {
      if (j < set[i - 1]) subset[i][j] = subset[i - 1][j];
      if (j >= set[i - 1])
        subset[i][j] = subset[i - 1][j] || subset[i - 1][j - set[i - 1]];
    }
  }
  return subset[n][sum];
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    n *= 2;
    vector<int> v(n), ans;
    for (int i = 0; i < n; i++) {
      cin >> v[i];
    }
    int temp = n, indx = n;
    while (temp != 0) {
      int x = indx, mx = INT_MIN;
      for (int i = 0; i < x; i++) {
        if (mx < v[i]) {
          mx = v[i];
          indx = i;
        }
      }
      temp = indx;
      ans.push_back(x - indx);
    }
    long long sum = 0;
    for (int i = 0; i < ans.size(); i++) {
      sum += ans[i];
    }
    if (sum % 2 != 0) {
      cout << "NO" << endl;
    } else {
      sum /= 2;
      if (subset_exists_recur(ans, n / 2, ans.size()))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
  return 0;
}
