import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
def check(n, a):
    d = deque(range(n))

    if 2 not in a:
        return False
    now = a.index(2)
    b = [0] * n
    f = 1
    for i in range(n):
        if a[(now + i) % n] == 0:
            b[(now + i) % n] = d.pop()
            f = 1
        elif a[(now + i) % n] == 2:
            b[(now + i) % n] = d.popleft()
            f = 0
        else:
            if f:
                b[(now + i) % n] = d.pop()
            else:
                b[(now + i) % n] = d.popleft()
    for i in range(n):
        if (b[(i - 1) % n] > b[i]) + (b[(i + 1) % n] > b[i]) == a[i]:
            pass
        else:
            return False
    return True

for _ in range(ii()):
    n = ii()
    a = li()
    if check(n, a):
        print('Yes')
    else:
        print('No')