T = input()

def solve():
    N = input()
    A = map(int, raw_input().split())
    asc = [1 for _ in xrange(N)]
    des = [1 for _ in xrange(N)]
    for i in xrange(N):
        for j in xrange(i):
            if A[i] - A[j] >= asc[j]:
                asc[i] = max(asc[i], asc[j]+1)
    for i in xrange(N-1, -1, -1):
        for j in xrange(N-1, i, -1):
            if A[i] - A[j] >= des[j]:
                des[i] = max(des[i], des[j]+1)
    print max(a+b for a, b in zip(asc, des)) - 1

for i in xrange(T):
    solve()