#import sys
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
import math
import bisect
import heapq
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e20)
mod = int(1e9)+7

t = int(input())
for _ in range(t):
    n = int(input())
    a = lmp()
    x = [i for i in range(1,n+1)]*2
    if a == x:
        print("Yes")
        continue
    flag = False
    for i in range(n):
        now = []
        cnt = 0
        for j in range(n*2):
            if i <= j <= i+n:
                now.append(x[i+n-cnt])
                cnt += 1
            else:
                now.append(x[j])
        if now == a:
            flag = True
        #print(now)
    if flag:
        print("Yes")
    else:
        print("No")