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
    j = 1
    while aa[j] != 0: j += 1
    if j & 1: return False

    if aa[n]!=0:
        for i in range((j+2)//2):
            if aa[i] != aa[j-i] or aa[i] != i: return False
    else:
        j=0


    if aa[n-1]!=n-1:
        i, j = 2*n-1, j+1
        a = n-1
        while j <= i:
            if aa[j] != aa[i] or aa[j] != a: return False
            j += 1
            i -= 1
            a -= 1

    return True

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