import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
# md = 998244353

from collections import Counter

def ok():
    n = II()
    aa = LI1()

    xx = list(range(n))
    xx *= 2
    if aa == xx: return True

    ac = Counter(aa)
    for a in range(n):
        if ac[a] != 2: return False

    if aa[0] != 0: return False
    l = 1
    while aa[l] == xx[l]: l += 1
    if l > n: return False
    r = l-1+n
    if aa[l:r] != xx[l:r][::-1]: return False
    if aa[r:] != xx[r:]: return False

    return True

for _ in range(II()):
    print("Yes" if ok() else "No")