#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
long long int inf = 0x3f3f3f3f;
vector<int> arr;
bool find(int sum) {
  sum = 2 * sum;
  int table[arr.size()][sum];
  memset(table, 0, sizeof table);
  sort(arr.begin(), arr.end());
  table[0][arr[0]] = 1;
  bool possible = false;
  for (int i = 1; i < (int)arr.size(); i++) {
    for (int j = 1; j <= sum; j++) {
      if (table[i - 1][j] != 0) {
        table[i][j] = 1;
        table[i][j + arr[i]] = 1;
      }
    }
    table[i][arr[i]] = 1;
  }
  for (int i = 0; i < arr.size(); i++) {
    if (table[i][sum / 2] == 1) return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(2 * n);
    for (int i = 0; i < 2 * n; i++) cin >> a[i];
    int cnt = 0;
    int cur = a[0];
    cnt++;
    int ok = 1;
    for (int i = 1; i < 2 * n; i++) {
      if (a[i] < cur)
        cnt++, ok = 0;
      else {
        ok = 1;
        arr.push_back(cnt);
        cnt = 1;
        cur = a[i];
      }
    }
    arr.push_back(cnt);
    bool possible = find(n);
    if (possible)
      cout << "YES\n";
    else
      cout << "NO\n";
    arr.clear();
  }
}
