#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> p(2 * n);
    for (auto &i : p) cin >> i;
    vector<int> lengths;
    int prev = p[0], cur = 0;
    for (int i = 0; i < 2 * n; ++i)
      if (p[i] <= prev)
        ++cur;
      else
        lengths.push_back(cur), cur = 1, prev = p[i];
    vector<int> dp(n + 1, 0);
    dp[0] = 1;
    for (auto l : lengths)
      for (int i = n; i - l >= 0; --i) dp[i] |= dp[i - l];
    if (dp[n])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
