import sys

sys.setrecursionlimit(10 ** 6)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))

def main():
    t=II()
    for _ in range(t):
        n=II()
        aa=LI()
        # dp0[i][j]...右端が...aa[j],aa[i]となる部分列の最大長
        dp0=[[1]*n for _ in range(n)]
        for i in range(n):
            for j in range(i):
                if aa[i]<=aa[j]:continue
                v=2
                d=aa[i]-aa[j]
                dpj=dp0[j]
                for k in range(j):
                    if aa[j]-aa[k]>=d:continue
                    if dpj[k]+1>v:v=dpj[k]+1
                dp0[i][j]=v
        # dp1[i][j]...左端がaa[i],aa[j]...となる部分列の最大長
        dp1=[[1]*n for _ in range(n)]
        for i in range(n-1,-1,-1):
            for j in range(n-1,i,-1):
                if aa[i]<=aa[j]:continue
                v=2
                d=aa[i]-aa[j]
                dpj=dp1[j]
                for k in range(n-1,j,-1):
                    if aa[j]-aa[k]>=d:continue
                    if dpj[k]+1>v:v=dpj[k]+1
                dp1[i][j]=v
        # aa[i]を頂点としたときの長さで最大を求める
        ans=0
        for i in range(n):
            cur=max(dp0[i])+max(dp1[i])-1
            if cur>ans:ans=cur
        print(ans)

main()