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):
    INF=10**9+7
    n=len(a)
    dp=[0]*n
    res=[1]*n
    for c in range(2, n+1):
        newdp=[INF]*n
        for i in range(n):
            ai=a[i]
            for j in range(i):
                aj=a[j]
                if dp[j]<ai-aj and ai-aj<newdp[i]:
                        newdp[i]=ai-aj
        end=True
        for i in range(n):
            if newdp[i]<INF:
                res[i]=c
                end=False
        if end:
            break
        dp=newdp
    return res
def solve():
    n=int(readline())
    a=list(map(int, readline().split()))
    x=myon(a)
    a=a[::-1]
    y=myon(a)
    y=y[::-1]
    print(max(p+q-1 for p, q in zip(x, y)))
for _ in range(t):
    solve()