#include <bits/stdc++.h>
using namespace std;
long long n, t, tmp, a[4005], pos[4005], ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  for (int rr = 0; rr < t; rr++) {
    cin >> n;
    bitset<4005> b, dp[4005];
    vector<long long> v;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> a[i];
      pos[a[i]] = i;
    }
    for (int i = 2 * n; i >= 1; i--) {
      if (!b[i]) {
        ans = 0;
        tmp = pos[i];
        while (!b[a[tmp]] && tmp <= 2 * n) {
          b[a[tmp]] = true;
          tmp++;
          ans++;
        }
        v.push_back(ans);
      }
    }
    dp[0][v[0]] = true;
    dp[0][0] = true;
    for (int i = 1; i < v.size(); i++) {
      for (int j = 0; j <= n; j++) {
        if (dp[i - 1][j]) {
          dp[i][j] = true;
          dp[i][j + v[i]] = true;
        }
      }
    }
    if (dp[v.size() - 1][n]) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
