#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int LINF = 1LL * INF * INF;
const int MAXN = 2e5 + 10;
const int MAXM = 2e3 + 10;
priority_queue<int> pq;
vector<vector<int> > graph;
queue<int> que;
int A[MAXM * 4];
bool dp[MAXM * 4];
int main() {
  int n, m, k, a, b, x, y, q;
  int sum = 0;
  int cnt = 0;
  int mx = 0;
  int mn = INF;
  int cur = 0, idx = -1;
  int tc;
  int pre = 0;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> tc;
  while (tc--) {
    cin >> n;
    for (int i = 1; i <= (n << 1); i++) {
      cin >> A[i];
    }
    mx = 0;
    pre = 0;
    fill(dp, dp + n + 1, false);
    dp[0] = true;
    A[(n << 1) | 1] = (n << 1) | 1;
    vector<int> pos;
    for (int i = 0; i <= (n << 1); i++) {
      mx = max(mx, A[i]);
      if (mx < A[i + 1]) {
        pos.push_back(i);
      }
    }
    for (int i = 1; i < pos.size(); i++) {
      cur = pos[i] - pos[i - 1];
      for (int i = n - cur; i >= 0; i--) {
        dp[i + cur] |= dp[i];
      }
    }
    if (dp[n])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
