#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> dp(2 * n);
    int mx = -1;
    int c = 0;
    dp[0] = 1;
    for (int i = 0; i < 2 * n; i++) {
      int u;
      cin >> u;
      if (mx > u) {
        c++;
      } else {
        for (int j = n + 1; j >= c; j--) {
          dp[j] |= dp[j - c];
        }
        c = 1;
        mx = u;
      }
    }
    for (int j = n; j >= c; j--) {
      dp[j] |= dp[j - c];
    }
    if (dp[n])
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
