#include <bits/stdc++.h>
using namespace std;
map<int, int> Pos, Vis;
vector<int> v;
int n, a[100010];
int N;
bool Ans;
bool Dp[4000][4000];
void Solve(int i = 0, int j = 0) {
  if (i == N) {
    Ans |= (j == n / 2);
    return;
  }
  if (Ans) return;
  bool &Res = Dp[i][j];
  if (Res) return;
  Res = true;
  Solve(i + 1, j);
  Solve(i + 1, j + v[i]);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int TT;
  cin >> TT;
  for (int T = 1; T <= TT; T++) {
    cin >> n;
    n *= 2;
    v.clear();
    Pos.clear();
    Vis.clear();
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      Pos[a[i]] = i;
      Vis[i + 1] = 0;
    }
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        Dp[i][j] = false;
      }
    }
    Ans = false;
    for (int i = n; i > 0; i--) {
      int j = Pos[i];
      int Cnt = 0;
      while (j < n && !Vis[j]) {
        Vis[j] = 1;
        j++;
        Cnt++;
      }
      if (Cnt != 0) v.push_back(Cnt);
    }
    N = v.size();
    Solve();
    cout << (Ans ? "YES" : "NO") << endl;
  }
  return 0;
}
