/* -*- coding: utf-8 -*-
 *
 * 1707.cc:  No.1707 Simple Range Reverse Problem - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 1000;
const int MAX_N2 = MAX_N * 2;

/* typedef */

/* global variables */

int u[MAX_N2], v[MAX_N2], w[MAX_N2];

/* subroutines */

bool eqv(int n, int v0[], int v1[]) {
  for (int i = 0; i < n; i++)
    if (v0[i] != v1[i]) return false;
  return true;
}

void printv(int n, int v[]) {
  for (int i = 0; i < n; i++) printf("%d ", v[i]);
  putchar('\n');
}

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);
    int n2 = n * 2;

    for (int i = 0; i < n2; i++) scanf("%d", w + i);

    for (int i = 0; i < n; i++) u[i] = u[i + n] = i + 1;
    //printv(n2, u);
    bool ok = eqv(n2, u, w);

    for (int i = 0; ! ok && i < n; i++) {
      copy(u, u + n2, v);
      reverse(v + i + 1, v + i + n);
      //printv(n2, v);
      ok = eqv(n2, v, w);
    }

    if (ok) puts("Yes");
    else puts("No");
  }

  return 0;
}