#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  int flag = 1;
  char ch = getchar();
  while (48 > ch || ch > 57) {
    if (ch == 45) flag = -1;
    ch = getchar();
  }
  while (48 <= ch && ch <= 57) x = x * 10 + ch - 48, ch = getchar();
  x *= flag;
}
template <typename T>
inline void print(T x) {
  if (x < 0) putchar(45), x = -x;
  if (x > 9) print(x / 10);
  putchar(x % 10 + 48);
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int m[4005], dp[4005];
    int n;
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) {
      cin >> m[i];
      dp[i] = 0;
    }
    vector<int> mx;
    int Max = 0;
    for (int i = 1; i <= 2 * n; i++) {
      if (Max < m[i]) {
        mx.push_back(i);
        Max = m[i];
      }
    }
    mx.push_back(2 * n + 1);
    int b[4005], cnt = 0;
    for (int i = 1; i < mx.size(); i++) {
      b[++cnt] = mx[i] - mx[i - 1];
    }
    dp[0] = 0;
    for (int i = 1; i <= cnt; i++) {
      for (int j = 2 * n; j >= b[i]; j--) {
        dp[j] = max(dp[j], dp[j - b[i]] + b[i]);
      }
    }
    if (dp[n] == n) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
