def get(a):
    n = len(a)
    dp = [[0]*n for _ in range(n)]
    for i in range(n):
        dp[i][i] = 1
        for j in range(i,n):
            for k in range(j+1,n):
                if a[j] < a[k] and a[j] - a[i] < a[k] - a[j]:
                    dp[j][k] = max(dp[j][k], dp[i][j] + 1)
    res = [0]*n    
    for i in range(n):
        for j in range(i,n):
            res[j] = max(res[j],dp[i][j])
    return res

def solve(a):
    r1 = get(a)
    r2 = get(a[::-1])[::-1]
    x = max(i+j for i,j in zip(r1,r2))
    return x-1

T = int(input())
for _ in range(T):
    n = int(input())
    *a, = map(int,input().split())
    print(solve(a))