#include <bits/stdc++.h>
using namespace std;
long long get_max(vector<long long>& v, long long l, long long r) {
  long long maxr = 0;
  for (long long i = l; i < r; i++) {
    maxr = max(maxr, v[i]);
  }
  return maxr;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> v(2 * n);
    for (long long i = 0; i < 2 * n; i++) {
      cin >> v[i];
    }
    vector<long long> len;
    set<long long> s;
    for (long long i = 1; i <= 2 * n; i++) {
      s.insert(i);
    }
    long long j = 2 * n - 1;
    set<long long>::iterator it;
    it = s.end();
    it--;
    long long id = *it, cnt = 0;
    while (j) {
      if (v[j] == id) {
        cnt++;
        len.push_back(cnt);
        s.erase(v[j]);
        cnt = 0;
        if (s.size() == 0) {
          break;
        }
        it = s.end();
        it--;
        id = *it;
      } else {
        cnt++;
        s.erase(v[j]);
      }
      j--;
    }
    sort(len.begin(), len.end());
    vector<long long> dp(2 * n + 1);
    dp[0] = 1;
    long long m = len.size();
    for (long long i = 0; i < m; i++) {
      vector<long long> ans;
      for (long long j = len[i]; j <= 2 * n; j++) {
        if (!dp[j] && dp[j - len[i]]) {
          ans.push_back(j);
        }
      }
      for (long long j = 0; j < ans.size(); j++) {
        dp[ans[j]] = 1;
      }
    }
    if (dp[n]) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
