#include <bits/stdc++.h>
using namespace std;
template <typename T>
void input(vector<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
  for (auto x : arr) cout << x << " ";
  cout << endl;
}
template <typename T>
void input_set(set<T> &arr, long long int n) {
  T temp;
  for (long long int i = 0; i < n; i++) cin >> temp, arr.insert(temp);
}
long long int mul(long long int a, long long int b) {
  return (a % 1000000007 * b % 1000000007) % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = mul(ans, a);
    a = mul(a, a);
    ;
    b >>= 1;
  }
  return ans;
}
void solve() {
  int n;
  vector<int> arr;
  cin >> n;
  input(arr, 2 * n);
  vector<int> nums;
  int ma = -0x3f3f3f3f, ind = 2 * n - 1;
  while (ind >= 0) {
    long long int prev = ind;
    ma = -0x3f3f3f3f;
    for (int i = ind; i >= 0; i--) {
      if (arr[i] > ma) ma = arr[i], ind = i;
    }
    nums.push_back(prev - ind + 1);
    --ind;
  }
  int target = n;
  n = nums.size();
  vector<vector<bool>> dp(n + 1, vector<bool>(target + 1, false));
  for (int i = 0; i <= n; i++) dp[i][0] = true;
  for (int i = 1; i <= n; i++) {
    for (int second = 0; second <= target; second++) {
      if (second - nums[i - 1] >= 0)
        dp[i][second] = dp[i - 1][second] or dp[i - 1][second - nums[i - 1]];
      else
        dp[i][second] = dp[i - 1][second];
    }
  }
  if (dp[n][target])
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int testcases;
  cin >> testcases;
  while (testcases--) {
    solve();
  }
}
