#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int arr[2 * n], maxi[2 * n], c = 1;
    vector<long long int> v;
    for (int i = 0; i < 2 * n; i++) {
      cin >> arr[i];
      if (!i)
        maxi[i] = arr[i];
      else
        maxi[i] = max(maxi[i - 1], arr[i]);
    }
    for (int i = 1; i < 2 * n; i++) {
      if (maxi[i] != maxi[i - 1])
        v.push_back(c), c = 1;
      else
        c++;
    }
    v.push_back(c);
    long long int dp[v.size()][n + 1];
    for (int i = 0; i < v.size(); i++) {
      for (int j = 0; j <= n; j++) dp[i][j] = 0;
    }
    dp[0][v[0]] = 1;
    for (int i = 1; i < v.size(); i++) {
      for (int j = 0; j <= n; j++) dp[i][j] = dp[i - 1][j];
      for (int j = v[i]; j <= n; j++) {
        if (dp[i - 1][j - v[i]]) dp[i][j] = 1;
      }
    }
    if (dp[v.size() - 1][n])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
