#include <bits/stdc++.h>
using namespace std;
const int maxn = 4020;
const int maxm = 10000020;
const int MOd = 998244353;
int a;
int ar[maxn], ok[maxn];
int dn[maxn][maxn][2];
int f(int n, int x, int s) {
  if (n == a + 1) return x == a / 2;
  int &ret = dn[n][x][s];
  if (ret != -1) return ret;
  if (f(n + 1, x + s, s)) return ret = 1;
  if (ok[n] && f(n + 1, x + !s, !s)) return ret = 1;
  return ret = 0;
}
void solve() {
  scanf("%d", &a);
  a += a;
  for (int i = 1; i <= a; i++) scanf("%d", &ar[i]);
  int maxi = 0;
  for (int i = 0; i <= a; i++)
    for (int j = 0; j <= a; j++) dn[i][j][0] = dn[i][j][1] = -1;
  for (int i = 1; i <= a; i++) ok[i] = 0;
  for (int i = 1; i <= a; i++)
    if (ar[i] > maxi) {
      ok[i] = 1;
      maxi = ar[i];
    }
  if (f(1, 0, 1))
    printf("YES\n");
  else
    printf("NO\n");
}
int main() {
  int n = 1;
  scanf("%d", &n);
  while (n--) solve();
  return 0;
}
