#include <bits/stdc++.h>
using namespace std;
bool possible(short int sum, vector<short int> &subsets) {
  bool dp[subsets.size() + 1][sum + 1];
  for (short int i = 0; i <= subsets.size(); i++) dp[i][0] = true;
  for (short int i = 1; i <= sum; i++) dp[0][i] = false;
  for (short int i = 1; i <= subsets.size(); i++) {
    for (short int j = 1; j <= sum; j++) {
      if (j - subsets[i - 1] >= 0)
        dp[i][j] = dp[i - 1][j - subsets[i - 1]] || dp[i - 1][j];
      else
        dp[i][j] = dp[i - 1][j];
    }
  }
  return dp[subsets.size()][sum];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  short int t;
  cin >> t;
  while (t--) {
    short int n, val;
    cin >> n;
    map<short int, short int> mp;
    for (short int i = 1; i <= 2 * n; i++) {
      cin >> val;
      mp[val] = i;
    }
    short int till = 2 * n + 1;
    vector<short int> subsets;
    for (short int num = 2 * n; num > 0; num--) {
      if (till >= mp[num]) {
        subsets.push_back(till - mp[num]);
        till = mp[num];
      }
    }
    if (possible(n, subsets))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
