#include <bits/stdc++.h>
using namespace std;
int dp[4200][4200];
int n;
vector<int> v, a;
void check() {
  int sum = 0;
  for (auto &i : v) sum += i;
  if (sum % 2) {
    cout << "NO\n";
    return;
  } else {
    for (int i = 0; i <= 2 * n + 2; i++)
      for (int j = 0; j <= 2 * n + 2; j++) dp[i][j] = 0;
    for (int i = 0; i <= 2 * n + 2; i++) dp[i][0] = 1;
    for (int i = 1; i < v.size(); i++) {
      for (int j = 0; j <= 2 * n; j++) {
        if (j - v[i] >= 0) {
          dp[i][j] = max(dp[i][j], dp[i - 1][j - v[i]]);
        }
        dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      }
    }
    if (dp[v.size() - 1][n])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
void __sol() {
  cin >> n;
  a.assign(2 * n, 0);
  for (int i = 0; i < 2 * n; i++) cin >> a[i];
  v.push_back(0);
  while (a.size() > 0) {
    int mx = -1, id = -1;
    for (auto &i : a) mx = max(mx, i);
    int cnt = 0;
    while (a.size() > 0 && a.back() != mx) cnt++, a.pop_back();
    cnt++;
    a.pop_back();
    v.push_back(cnt);
  }
  check();
  v.clear();
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) __sol();
}
