#include <bits/stdc++.h>
using namespace std;
int a[4010];
int b[1010];
int dp[4010];
int main() {
  int T;
  cin >> T;
  while (T--) {
    int n;
    cin >> n;
    for (int i = 0; i < 2 * n; i++) cin >> a[i];
    memset(dp, 0, sizeof(dp));
    vector<int> v;
    for (int i = 0; i < 2 * n; i++) {
      int pp = a[i];
      int cnt = 0;
      i++;
      cnt++;
      while (i < 2 * n && a[i] < pp) {
        cnt++;
        i++;
      }
      i--;
      v.push_back(cnt);
    }
    dp[0] = 1;
    for (int i = 0; i < v.size(); i++) {
      for (int j = n; j >= v[i]; j--) {
        if (dp[j - v[i]] != 0) dp[j] = dp[j - v[i]] + 1;
      }
    }
    if (dp[n] != 0)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
