#include <bits/stdc++.h>
using namespace std;
const int maxn = 10004;
int n, t, a[maxn], dp[maxn];
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n * 2; i++) cin >> a[i];
    vector<int> v;
    int cnt = 1, cur = a[1];
    for (int i = 2; i <= n * 2; i++, cnt++) {
      if (a[i] > cur) {
        v.push_back(cnt);
        cur = a[i];
        cnt = 0;
      }
    }
    memset(dp, 0, sizeof(dp));
    cnt = v.size();
    for (int i = 0; i < cnt; i++)
      for (int j = n; j >= v[i]; j--) dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
    if (dp[n] == n)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
