def is_kadomatsu(a,b,c):
    return a!=b and b!=c and c!=a and (b==max(a,b,c) or b==min(a,b,c))

def check(a,res):
    return all(is_kadomatsu(a[i],a[i+1],a[i+2]) for i in res)

def checkv(a,i):
    if i < n-2 and not is_kadomatsu(a[i],a[i+1],a[i+2]): return False
    if 0 <= i-1 < n-2 and not is_kadomatsu(a[i-1],a[i],a[i+1]): return False
    if 0 <= i-2 < n-2 and not is_kadomatsu(a[i-2],a[i-1],a[i]): return False
    return True

def solve(n,a):
    res = [i for i in range(n-2) if not is_kadomatsu(a[i],a[i+1],a[i+2])]
    if len(res) >= 7: return 0
    v = res[0]
    for i in range(v,min(v+3,n)):
        for j in range(n):
            if i==j: continue
            a[i],a[j] = a[j],a[i]
            if check(a,res) and checkv(a,i) and checkv(a,j):
                return 1
            a[i],a[j] = a[j],a[i]
    return 0    

T = int(input())
for _ in range(T):
    n = int(input())
    *a, = map(int,input().split())
    print("Yes" if solve(n,a) else "No")