import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A;

bool solve() {
  auto freq = new int[N];
  foreach (i; 0 .. 2 * N) {
    ++freq[A[i]];
  }
  if (!freq.all!"a == 2") {
    return false;
  }
  int[] diffs;
  foreach (i; 0 .. 2 * N) {
    if (i % N != A[i]) {
      diffs ~= i;
    }
  }
  if (diffs.empty) {
    return true;
  }
  const l = diffs[0] - 1;
  const r = diffs[$ - 1] + 1;
  if (!(0 <= l && r < 2 * N && l + N == r)) {
    return false;
  }
  foreach (i; l + 1 .. r) {
    if (i % N != A[l + r - i]) {
      return false;
    }
  }
  return true;
}

void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        N = readInt;
        A = new int[2 * N];
        foreach (i; 0 .. 2 * N) {
          A[i] = readInt - 1;
        }
        
        const ans = solve;
        writeln(ans ? "Yes" : "No");
      }
    }
  } catch (EOFException e) {
  }
}