#include <bits/stdc++.h>
using namespace std;
bool findPartiion(vector<long long int> arr, long long int n) {
  long long int sum = 0;
  long long 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];
}
void Go() {
  long long int n;
  cin >> n;
  long long int arr[2 * n];
  for (long long int i = 0; i < 2 * n; i++) cin >> arr[i];
  vector<long long int> vec;
  long long int cnt = 1, i = 1, maxi = arr[0];
  while (i <= 2 * n) {
    while (i < 2 * n and arr[i] < maxi) {
      i++;
      cnt++;
    }
    if (i == 2 * n) {
      vec.push_back(cnt);
      break;
    }
    vec.push_back(cnt);
    cnt = 1;
    maxi = arr[i];
    i++;
  }
  if (findPartiion(vec, vec.size()))
    cout << "YES\n";
  else
    cout << "NO\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  cin >> t;
  while (t--) {
    Go();
  }
  return 0;
}
