#include <bits/stdc++.h>
using namespace std;
const int N = 200100;
const int mod = 998244353;
const double Pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int G = 3, Gi = 332748118;
long long qpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int T, n;
int a[N], cnt = 0;
int dp[N];
int main() {
  scanf("%d", &T);
  while (T--) {
    cnt = 0;
    scanf("%d", &n);
    int maxx = -1, num = 0;
    for (int i = 1; i <= n * 2; ++i) {
      int x;
      scanf("%d", &x);
      if (x > maxx) {
        if (maxx != -1) a[++cnt] = num;
        maxx = x;
        num = 0;
      }
      num++;
    }
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= cnt; ++i) {
      for (int j = n; j >= a[i]; --j) {
        dp[j] = max(dp[j], dp[j - a[i]] + a[i]);
      }
    }
    if (dp[n] == n)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
