#include <bits/stdc++.h>
using namespace std;
vector<int> curr;
int dp[4096][4096 / 2];
int v[4096], d[4096];
int i, n, cnt, current, X, j;
int main() {
  int T = 1;
  cin >> T;
  while (T--) {
    for (i = 0; i < X; ++i) dp[0][i] = 0;
    cin >> n;
    for (i = 0; i < 2 * n; ++i) cin >> v[i];
    d[0] = v[0];
    for (i = 1; i < 2 * n; ++i) d[i] = max(d[i - 1], v[i]);
    cnt = 0;
    curr.clear();
    for (i = 2 * n - 1; i > -1; --i) {
      ++cnt;
      if (d[i] == v[i]) {
        curr.push_back(cnt);
        cnt = 0;
      }
    }
    X = n + 1;
    dp[0][0] = 1;
    if (curr[0] < X) dp[0][curr[0]] = 1;
    for (i = 1; i < curr.size(); ++i) {
      for (j = 0; j < X; ++j) {
        if (dp[i - 1][j] > 0 ||
            (j - curr[i] > -1 && dp[i - 1][j - curr[i]] > 0))
          dp[i][j] = 1;
        else
          dp[i][j] = 0;
      }
    }
    if (dp[curr.size() - 1][n] < 1)
      cout << "NO";
    else
      cout << "YES";
    cout << '\n';
  }
  return 0;
}
