#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
void setIO(string name = "") {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  if ((int)(name).size()) {
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
  }
}
const int MAXN = 2005;
int n;
vector<int> g;
bool dp[MAXN * 2][MAXN];
int main() {
  setIO();
  int t;
  cin >> t;
  while (t--) {
    g.clear();
    cin >> n;
    int mx, cnt = 1;
    cin >> mx;
    for (int i = 1; i < n * 2; i++) {
      int p;
      cin >> p;
      if (p > mx) {
        mx = p;
        g.push_back(cnt);
        cnt = 0;
      }
      cnt++;
    }
    g.push_back(cnt);
    memset(dp, false, sizeof dp);
    dp[0][0] = true;
    for (int i = 1; i <= (int)(g).size(); i++) {
      for (int j = 0; j <= n; j++) {
        dp[i][j] = dp[i - 1][j];
        if (!dp[i][j] && g[i - 1] <= j) {
          dp[i][j] = dp[i - 1][j - g[i - 1]];
        }
      }
    }
    cout << (dp[(int)(g).size()][n] ? "YES" : "NO") << '\n';
  }
}
