#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
class BUnmerge {
 public:
  void calc(istream& cin, ostream& cout) {
    int n;
    cin >> n;
    int n2 = n * 2;
    vector<int> pos(n2 + 1);
    for (int i = 0; i < n2; i++) {
      int a;
      cin >> a;
      pos[a] = i;
    }
    vector<vector<bool>> dp(n + 1, vector<bool>(n + 1));
    int end = n2 - 1;
    dp[0][0] = true;
    int now = 0;
    for (int i = n2; i >= 1; i--) {
      if (pos[i] > end) continue;
      int cnt = end - pos[i] + 1;
      42;
      end = pos[i] - 1;
      for (int j = 0; j <= now; j++) {
        int k = now - j;
        if (j > n || k > n) continue;
        if (dp[j][k]) {
          42;
          if (j + cnt <= n) dp[j + cnt][k] = true;
          if (k + cnt <= n) dp[j][k + cnt] = true;
        }
      }
      now += cnt;
    }
    if (dp[n][n]) {
      cout << "YES" << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
  void solve(istream& cin, ostream& cout) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
      calc(cin, cout);
    }
  }
};
signed main() {
  BUnmerge solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
