#include <bits/stdc++.h>
using namespace std;
void INPUT() {}
const int N = 4005;
int dp[N][N];
int n;
int sz;
bool f(int x, int y, vector<int> &a) {
  if (y == 0) return 1;
  if (x == sz) return 0;
  if (dp[x][y] != -1) return dp[x][y];
  bool op1 = 0, op2 = 0;
  if (y >= a[x]) op1 = f(x + 1, y - a[x], a);
  if (!op1) op2 = f(x + 1, y, a);
  dp[x][y] = op1 | op2;
  return dp[x][y];
}
void solve() {
  cin >> n;
  vector<int> v(2 * n);
  for (int i = 0; i <= 2 * n - 1; i++) cin >> v[i];
  for (int i = 0; i <= 2 * n; i++) {
    for (int j = 0; j <= 2 * n; j++) dp[i][j] = -1;
  }
  vector<int> a;
  vector<int> vis(2 * n + 1, 0);
  int mx = 2 * n;
  int last = 2 * n;
  for (int i = 2 * n - 1; i >= 0; i--) {
    vis[v[i]] = 1;
    if (v[i] == mx) {
      a.push_back(last - i);
      last = i;
      while (mx >= 0 and vis[mx]) mx--;
    }
  }
  sz = a.size();
  if (f(0, n, a))
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  INPUT();
  int t;
  t = 1;
  cin >> t;
  for (int i = 0; i <= t - 1; i++) {
    solve();
  }
  return 0;
}
