#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const long long N = 2010;
long long a[N * 2], f[N * 2], g[N];
long long n;
int32_t main() {
  long long T;
  cin >> T;
  while (T--) {
    memset(f, 0, sizeof f);
    memset(g, 0, sizeof g);
    cin >> n;
    for (long long i = 0; i < 2 * n; i++) cin >> a[i];
    long long maxv = a[0];
    f[maxv]++;
    for (long long i = 1; i < 2 * n; i++) {
      if (a[i] > maxv) {
        maxv = a[i];
        f[maxv]++;
      } else
        f[maxv]++;
    }
    for (long long i = 1; i <= 2 * n; i++)
      for (long long j = n; j >= f[i]; j--)
        g[j] = max(g[j], g[j - f[i]] + f[i]);
    if (g[n] == n)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
  return 0;
}
