#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e3 + 5;
const long long MOD = 1e9 + 7;
int arr[MAXN];
vector<int> groupSz;
int dp[MAXN][MAXN];
bool isPos(int idx, int sz) {
  if (idx == groupSz.size()) return sz == 0;
  if (dp[idx][sz] != -1) return dp[idx][sz];
  bool skip = isPos(idx + 1, sz);
  bool take = isPos(idx + 1, sz - groupSz[idx]);
  return dp[idx][sz] = skip | take;
}
void solve() {
  int n;
  cin >> n;
  groupSz.clear();
  for (int i = 0; i <= 2 * n; i++)
    for (int j = 0; j <= 2 * n; j++) dp[i][j] = -1;
  for (int i = 1; i <= 2 * n; i++) {
    cin >> arr[i];
  }
  int sz = 1;
  int large = arr[1];
  for (int i = 2; i <= 2 * n; i++) {
    if (arr[i] < large) {
      sz++;
    } else {
      groupSz.push_back(sz);
      sz = 1;
      large = arr[i];
    }
  }
  if (isPos(0, n))
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  int TC;
  cin >> TC;
  while (TC--) {
    solve();
  }
}
