#include <bits/stdc++.h>
using namespace std;
vector<long long> vect;
long long dp[4000][4000];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[2 * n];
    long long c = 0, m = -1;
    vect.clear();
    for (long long i = 0; i < 2 * n; i++) {
      cin >> a[i];
    }
    map<long long, long long> mp;
    long long p = 2 * n;
    for (long long i = (2 * n) - 1; i >= 0; i--) {
      if (a[i] != p) {
        c++;
        mp[a[i]]++;
      } else {
        vect.push_back(c + 1);
        c = 0;
        p--;
        while (mp[p]) {
          p--;
        }
      }
    }
    if (c > 0) {
      vect.push_back(c);
    }
    long long l = vect.size() - 1;
    for (long long i = 0; i <= l; i++) {
      for (long long j = 0; j <= n + 1; j++) {
        if (j == 0) {
          dp[i][j] = 1;
        } else if (i == 0) {
          dp[i][j] = 0;
        }
      }
    }
    dp[0][0] = 1;
    for (long long i = 1; i <= l; i++) {
      for (long long j = 1; j <= n + 1; j++) {
        if (j >= vect[i - 1]) {
          dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - vect[i - 1]]);
        } else {
          dp[i][j] = dp[i - 1][j];
        }
      }
    }
    if (dp[l][n]) {
      cout << "YES" << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
  return 0;
}
