import math
def f(m):
    tmp=lst[:]
    tmp[0]=m
    tmp.sort()
    # print()
    # print(m)
    idx=tmp.index(m)
    median=int(math.ceil(n/2))-1
    # print(idx,median)
    if idx==median:
        return True
    if idx>median:
        neg=False
    else:
        neg=True
    # print(neg)
    ct=0
    for i in range(n):
        if tmp[i]==m:
            continue
        if neg:
            if tmp[i]>m and -tmp[i]<m:
                ct+=1
        else:
            if tmp[i]<m and -tmp[i]>m:
                ct+=1
    
    if ct>=abs(median-idx):
        return True

    return False




T=int(input())
for __ in range(T):
    n=int(input())
    lst=list(map(int,input().split()))
    
    if f(lst[0]) or f(-1*lst[0]):
        print("yes")
        continue
    print("no")