import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
import itertools
t=int(readline())
def myon(a):
    n=len(a)
    dp=[[0]*n for i in range(n)]
    res=[1]*n
    for j, i in itertools.combinations(range(n), 2):
        ai, aj=a[i], a[j]
        if aj<ai and dp[j][i]==0:
            dp[j][i]=2
        x=dp[j][i]
        if x==0:
            continue
        if x>res[i]:
            res[i]=x
        for k in range(i+1, n):
            if a[k]-ai>ai-aj and dp[i][k]<x+1:
                dp[i][k]=x+1
    return res
def solve():
    n=int(readline())
    a=list(map(int, readline().split()))
    x=myon(a)
    a.reverse()
    y=myon(a)
    print(max(p+q-1 for p, q in zip(x, y)))
for _ in range(t):
    solve()