#include <bits/stdc++.h>
using namespace std;
int n, a[4005], cur, sum;
vector<int> v;
int dp[4005][2005];
int main(void) {
  int t, T;
  scanf("%d", &T);
  for (t = 0; t < T; t++) {
    v.clear();
    scanf("%d", &n);
    for (int i = 0; i < 2 * n; i++) scanf("%d", a + i);
    cur = 0;
    for (int i = 0; i < 2 * n; i++) {
      if (a[i] > cur) {
        v.push_back(1);
        cur = a[i];
      } else {
        v.back()++;
      }
    }
    for (int i = 0; i <= v.size(); i++) {
      dp[i][0] = 1;
    }
    for (int j = 1; j <= n; j++) {
      dp[0][j] = 0;
    }
    for (int i = 1; i <= v.size(); i++) {
      for (int j = 1; j <= n; j++) {
        if (j < v[i - 1]) {
          dp[i][j] = dp[i - 1][j];
        } else {
          dp[i][j] = dp[i - 1][j] || dp[i - 1][j - v[i - 1]];
        }
      }
    }
    if (dp[v.size()][n])
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
