#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return (b ? gcd(b, a % b) : a);
}
long long int add(long long int a, long long int b, long long int m) {
  return (((a % m) + (b % m)) % m);
}
long long int substract(long long int a, long long int b, long long int m) {
  if (a < b) swap(a, b);
  return (((a % m) - (b % m)) % m);
}
long long int multiply(long long int a, long long int b, long long int m) {
  return (((a % m) * (b % m)) % m);
}
long long int fact_pow(long long int n, long long int k) {
  long long int res = 0;
  while (n) {
    n /= k;
    res += n;
  }
  return res;
}
long long int power(long long int x, unsigned long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
unsigned long long int factorial(unsigned long long int x) {
  if (x <= 1) return 1;
  return x * factorial(x - 1);
}
long long int nCr(unsigned long long int n, unsigned long long int r) {
  long long int p = 1, k = 1;
  if (n - r < r) r = n - r;
  if (r != 0) {
    while (r) {
      p *= n;
      k *= r;
      long long int m = gcd(p, k);
      p /= m;
      k /= m;
      n--;
      r--;
    }
  } else
    p = 1;
  return p;
}
vector<long long int> factors(long long int n) {
  vector<long long int> factorization;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      factorization.push_back(i);
      if (n / i != i) factorization.push_back(n / i);
    }
  }
  factorization.push_back(1);
  if (n != 1) factorization.push_back(n);
  sort(factorization.begin(), factorization.end());
  return factorization;
}
bool isPowerOfTwo(long long int n) {
  if (n == 0) return false;
  return (ceil(log2(n)) == floor(log2(n)));
}
bool prime[10000005];
void SieveOfEratosthenes(long long int n) {
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
bool isPrime(long long int n) {
  if (n < 2) return false;
  for (long long int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void solve() {
  long long int n, i, j, cnt;
  cin >> n;
  vector<long long int> v(2 * n);
  for (i = 0; i < 2 * n; i++) cin >> v[i];
  vector<long long int> temp;
  for (i = 0; i < 2 * n;) {
    cnt = 1;
    j = i + 1;
    if (j < 2 * n && v[j] <= v[i]) {
      while (j < 2 * n && v[j] <= v[i]) {
        cnt++;
        j++;
      }
      i = j;
    } else {
      i++;
    }
    temp.push_back(cnt);
  }
  long long int sum = n, m = temp.size();
  bool dp[m + 1][sum + 1];
  for (i = 0; i <= m; i++) {
    dp[i][0] = true;
  }
  for (i = 1; i <= sum; i++) {
    dp[0][i] = false;
  }
  for (i = 1; i <= m; i++) {
    for (j = 1; j <= sum; j++) {
      if (j < temp[i - 1])
        dp[i][j] = dp[i - 1][j];
      else
        dp[i][j] = dp[i - 1][j] || dp[i - 1][j - temp[i - 1]];
    }
  }
  if (dp[m][sum])
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
