#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 4e3 + 5;
const long long mod = 1e9 + 7;
int dp[maxn];
int a[maxn];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < 2 * n; i++) cin >> a[i];
  int cnt = 1;
  vector<int> num;
  for (int i = 0; i < 2 * n; i++) {
    int j;
    for (j = i + 1; j < 2 * n; j++)
      if (a[j] > a[i]) break;
    num.push_back(j - i);
    i = j - 1;
  }
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  for (int i : num) {
    for (int j = n; j >= i; j--) dp[j] = max(dp[j], dp[j - i]);
  }
  if (dp[n])
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}
