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 solve():
    n = ii()
    a = li()
    if 2 not in a or 0 not in a:
        return 'No'
    
    for i in range(n):
        if a[i - 1] == a[i] and a[i] in [0, 2]:
            return 'No'
    
    if sum(a) != n:
        return 'No'
    return 'Yes'

for _ in range(ii()):
    print(solve())