#include <bits/stdc++.h>
using namespace std;
int s[4005], dp[2005];
vector<int> v;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) cin >> s[i];
    v.clear();
    for (int i = 1; i <= 2 * n; i++) {
      int j = i;
      while (j + 1 <= 2 * n && s[j + 1] < s[i]) j++;
      v.push_back(j - i + 1);
      i = j;
    }
    dp[0] = 1;
    for (int i = 1; i <= n; i++) dp[i] = 0;
    for (int i : v)
      for (int j = n; j >= i; j--) dp[j] |= dp[j - i];
    cout << (dp[n] ? "YES" : "NO") << endl;
  }
  return 0;
}
