#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const double esp = 1e-6, pi = acos(-1);
const int N = 1e6 + 10, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int cinint() {
  int t;
  scanf("%d", &t);
  return t;
}
int cinll() {
  long long t;
  scanf("%lld", &t);
  return t;
}
int a[N], b[N], dp[N];
int work() {
  int n = cinint();
  int maxn = 0;
  vector<int> ans;
  for (int i = 1; i <= 2 * n; i++) {
    a[i] = cinint();
    if (maxn <= a[i]) maxn = a[i], ans.push_back(i);
  }
  ans.push_back(2 * n + 1);
  int cnt = 0;
  for (int i = 1; i < ans.size(); i++) b[++cnt] = ans[i] - ans[i - 1];
  for (int i = 0; i <= n; i++) dp[i] = -INF;
  dp[0] = 0;
  for (int i = 1; i <= cnt; i++) {
    for (int j = n; j >= b[i]; j--) {
      dp[j] = max(dp[j], dp[j - b[i]] + b[i]);
    }
  }
  printf("%s\n", dp[n] == n ? "YES" : "NO");
  return 0;
}
int main() {
  int t = cinint();
  while (t--) work();
  return 0;
}
