def solve():
    n = int(input())
    aa = list(map(int, input().split()))

    zero = aa.count(0)
    if zero == 0 or zero > n // 2:
        return False

    one = aa.count(0)
    if one == 0 or one > n // 2:
        return False

    if zero != one:
        return False

    for i in range(n):
        if aa[i] == aa[(i + 1) % n] and aa[i] in (0, 2):
            return False

    return True

t = int(input())
for _ in range(t):
    print("Yes" if solve() else "No")