import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


T = int(input())
for _ in range(T):
    N = int(input())
    A = list(map(int, input().split()))

    B = [i for i in range(1, N + 1)] * 2
    if A == B:
        print('Yes')
        continue
    flag = False
    for i in range(N):
        C = B[:i] + B[i:i+N+1][::-1] + B[i+N+1:]
        if A == C:
            flag = True
            break
    print('Yes' if flag else 'No')