#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    vector<int> a(2 * n), pos(2 * n + 1);
    for (int i = 0; i < 2 * n; i++) {
      cin >> a[i];
      pos[a[i]] = i;
    }
    vector<int> Seen(2 * n + 1, 0);
    vector<int> sums;
    for (int i = 2 * n - 1; i >= 0; i--) {
      int maxNotSeen = -1;
      for (int j = 2 * n; j >= 1; j--) {
        if (Seen[j]) {
          continue;
        }
        maxNotSeen = j;
        break;
      }
      if (maxNotSeen == -1) {
        break;
      }
      int prev = i, j;
      for (j = i; j >= 0; j--) {
        if (a[j] == maxNotSeen) {
          Seen[a[j]] = 1;
          sums.push_back(prev - j + 1);
          break;
        } else {
          Seen[a[j]] = 1;
        }
      }
      i = j;
    }
    long long int sum = 0;
    for (int i = 0; i < sums.size(); i++) {
      sum += sums[i];
    }
    if (sum % 2 != 0) {
      cout << "NO\n";
      continue;
    }
    vector<int> weights(sum + 1, 0);
    weights[0] = 1;
    for (int i = 0; i < sums.size(); i++) {
      for (int j = sum; j >= sums[i]; j--) {
        weights[j] |= weights[j - sums[i]];
      }
    }
    weights[sum / 2] ? cout << "YES\n" : cout << "NO\n";
  }
  return 0;
}
