#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
int n, a[4005], f[4005];
vector<int> res;
int main() {
  fastio();
  int _;
  for (cin >> _; _; _--) {
    cin >> n;
    res.clear();
    for (int i = (1); i <= (2 * n); i++) cin >> a[i];
    for (int i = (1); i <= (2 * n); i++) {
      int now = i;
      while (i + 1 <= 2 * n && a[i + 1] < a[now]) i++;
      res.push_back(i - now + 1);
    }
    for (int i = (1); i <= (n); i++) f[i] = 0;
    f[0] = 1;
    for (int x : res) {
      for (int i = (n); i >= (0); i--) {
        if (x + i > n) continue;
        if (f[i]) {
          f[x + i] = 1;
        }
      }
    }
    if (f[n]) {
      cout << "YES" << endl;
    } else
      cout << "NO" << endl;
  }
  return 0;
}
