#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
inline int add(int a, int b) {
  int ret = ((long long int)a + b) % mod;
  if (ret < 0) ret += mod;
  return ret;
}
inline int mul(int a, int b) {
  int ret = ((long long int)a * b) % mod;
  if (ret < 0) ret += mod;
  return ret;
}
template <typename... Args>
inline int add(int a, Args... args) {
  return add(a, add(args...));
}
template <typename... Args>
inline int mul(int a, Args... args) {
  return mul(a, mul(args...));
}
inline int addm(int a, int b, int MOD) {
  int ret = ((long long int)a + b) % MOD;
  if (ret < 0) ret += MOD;
  return ret;
}
inline int mulm(int a, int b, int MOD) {
  int ret = ((long long int)a * b) % MOD;
  if (ret < 0) ret += MOD;
  return ret;
}
inline int addm(int a, int b, int c, int MOD) {
  return addm(a, addm(b, c, MOD), MOD);
}
inline int mulm(int a, int b, int c, int MOD) {
  return mulm(a, mulm(b, c, MOD), MOD);
}
template <typename T>
void show2d(const vector<vector<T>> &adj) {
  for (auto x : adj) {
    for (auto y : x) cout << y << " ";
    cout << "\n";
  }
}
long long int modexp(long long int a, long long int b, long long int mod) {
  long long int x = 1;
  while (b) {
    if (b & 1) x = ((x % mod) * (a % mod)) % mod;
    a = ((a % mod) * (a % mod)) % mod;
    b = b / 2;
  }
  return x;
}
int findInString(string &str, char ch) {
  int n = str.length();
  for (int i = 0; i < n; ++i) {
    if (str[i] == ch) return i;
  }
  return -1;
}
void rf() {}
void solve() {
  int n;
  cin >> n;
  vector<int> a(2 * n);
  for (auto &it : a) cin >> it;
  vector<int> segments;
  int i = 0;
  while (i < 2 * n) {
    int cur_count = 1;
    int j = i + 1;
    while (j < 2 * n and a[j] < a[i]) {
      ++cur_count;
      ++j;
    }
    segments.push_back(cur_count);
    i = j;
  }
  int target = n;
  bool dp[target + 1];
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  for (auto x : segments) {
    for (int i = target; i >= 0; --i) {
      if ((i + x) <= target) {
        dp[i + x] |= dp[i];
      }
    }
  }
  if (dp[target])
    cout << "YES\n";
  else
    cout << "NO\n";
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
