#include <bits/stdc++.h>
using namespace std;
bool isSubsetSum(vector<int> &set, int n, int sum) {
  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];
}
bool solve(int *arr, int *idx, int *pref, int n) {
  int z, cnt = 0;
  vector<int> b;
  for (int i = n; i > 0;) {
    z = idx[pref[i]];
    while (i >= z) {
      cnt++;
      i--;
    }
    b.push_back(cnt);
    cnt = 0;
  }
  return isSubsetSum(b, b.size(), n / 2);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t, n;
  cin >> t;
  while (t--) {
    cin >> n;
    n = 2 * n;
    int pref[n + 1], p[n + 1], idx[n + 1];
    p[0] = 0;
    pref[0] = 0;
    for (int i = 1; i <= n; i++)
      cin >> p[i], idx[p[i]] = i, pref[i] = max(p[i], pref[i - 1]);
    if (solve(p, idx, pref, n))
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
