import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines

t=int(readline())
def solve():
    n=int(readline())
    a=list(map(int, readline().split()))
    dp0=[[0]*n for i in range(n)]
    dp1=[[0]*n for i in range(n)]
    ans=1
    for i in range(n):
        for j in range(i):
            if a[j]<a[i] and dp0[j][i]==0:
                dp0[j][i]=2
            if a[j]>a[i] and dp1[j][i]==0:
                dp1[j][i]=2
            x, y=dp0[j][i], dp1[j][i]
            if ans<x:
                ans=x
            if ans<y:
                ans=y
            if x>0:
                for k in range(i+1, n):
                    if a[i]-a[j]<a[k]-a[i] and dp0[i][k]<x+1:
                        dp0[i][k]=x+1
                    if a[i]>a[k] and dp1[i][k]<x+1:
                        dp1[i][k]=x+1
            if y>0:
                for k in range(i+1, n):
                    if a[i]>a[k] and a[j]-a[i]>a[i]-a[k] and dp1[i][k]<y+1:
                        dp1[i][k]=y+1
    print(ans)                        
for _ in range(t):
    solve()