import sys

input = sys.stdin.buffer.readline


def solve(N, A):
    B = list(range(1, N + 1)) * 2
    if A == B:
        return True
    i0 = 0
    for i, a in enumerate(A):
        if a != i + 1:
            i0 = i
            break
    if i0 == 0:
        return False

    for j in range((N - 1) // 2):
        B[i0 + j], B[i0 + N - 2 - j] = B[i0 + N - 2 - j], B[i0 + j]
    return A == B


T = int(input())
for _ in range(T):
    N = int(input())
    A = list(map(int, input().split()))
    print('Yes' if solve(N, A) else 'No')