#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
long long int p[10005], dp[5002][5002];
bool ans(long long int i, long long int j, long long int k, long long int n) {
  if (i == 0 && j == 0) return true;
  if (i < 0 || j < 0) return false;
  if (dp[i][j] != -1) return dp[i][j];
  long long int curr = p[k], cnt = 0;
  while (k < 2 * n && curr >= p[k]) k++, cnt++;
  return dp[i][j] = ans(i - cnt, j, k, n) || ans(i, j - cnt, k, n);
}
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;
    vector<long long int> v;
    for (long long int i = 0; i < 2 * n; i++) {
      cin >> p[i];
    }
    p[2 * n] = INT_MAX;
    for (long long int i = 0; i < n + 1; i++) {
      for (long long int j = 0; j < n + 1; j++) dp[i][j] = -1;
    }
    if (ans(n, n, 0, n))
      cout << "YES"
           << "\n";
    else
      cout << "NO"
           << "\n";
  }
  return 0;
}
