#include <bits/stdc++.h>
using namespace std;
const int N = 4e3 + 7;
int t, n, a[N], v[N];
bool dp[N];
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    for (int i = 1; i <= 2 * n; i++) scanf("%d", &a[i]), dp[i] = false;
    int cnt = 0;
    for (int l = 1, r; l <= 2 * n; l = r) {
      int temp = 1;
      for (r = l + 1; r <= 2 * n; r++) {
        if (a[r] < a[l])
          temp++;
        else
          break;
      }
      v[++cnt] = temp;
    }
    dp[0] = true;
    for (int i = 1; i <= cnt; i++)
      for (int j = n; j >= v[i]; j--) {
        dp[j] |= dp[j - v[i]];
      }
    if (dp[n])
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
