import sys, time, random, itertools, heapq, math
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()

    dp = [[0, 0], [0, 0]]

    dp[a[0]][0] = 1

    for i in range(1, n):
        e = [[0, 0], [0, 0]]
        for j in range(2):
            e[a[i]][(j + 1) % 2] |= dp[1 - a[i]][j]
            e[a[i]][j] |= dp[a[i]][j]
        e[a[i]][0] |= dp[a[i]][1]
        dp = e
    print('Yes' if dp[0][1] or dp[1][1] else 'No')
        

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