#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long N = 998244353;
long long binpow(long long b, long long p) {
  long long ans = 1;
  while (p > 0) {
    if (p & 1) ans = (ans * b) % mod;
    b = (b * b) % mod;
    p >>= 1;
  }
  return ans;
}
long long modinv(long long x) { return binpow(x, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tt, i, n;
  cin >> tt;
  while (tt--) {
    cin >> n;
    long long x, k, max1;
    vector<long long> sizes;
    cin >> x;
    max1 = x;
    k = 1;
    for (i = 1; i < 2 * n; i++) {
      cin >> x;
      if (x > max1) {
        sizes.push_back(k);
        k = 1;
        max1 = x;
      } else
        k++;
    }
    sizes.push_back(k);
    vector<bool> dp(n + 1, false);
    dp[0] = true;
    for (auto& a : sizes) {
      for (i = (n + 1 - a - 1); i >= 0; i--) {
        if (dp[i]) dp[i + a] = true;
      }
    }
    cout << ((dp[n]) ? "YES" : "NO") << endl;
  }
  return 0;
}
