from cmath import inf from re import M import sys from collections import deque, Counter from math import atan2, gcd, log10, pi, sqrt, ceil from bisect import bisect, bisect_left, bisect_right, insort from typing import Iterable, TypeVar, Union, Tuple, Iterator, List # import bisect from decimal import * import time import copy import heapq import itertools import math import random from fractions import Fraction from functools import lru_cache, partial, cmp_to_key import operator # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') # import string # import networkx as nx input = sys.stdin.readline sys.setrecursionlimit(10000000) mod = 10 ** 9 + 7 mod2 = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return map(int, input().split()) def read_index(): return map(lambda x: int(x) - 1, input().split()) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def main(): t=int(input()) for _ in range(t): n=int(input()) a=read_list() if a[0]+a[-1]==1: print('Yes') continue ok=False for i in range(n-1): ok|=a[0]+a[i]==1 and a[0]+a[i+1]==1 if ok: print('Yes') else: print('No') if __name__ == "__main__": main()