def sol():
    N = int(input())
    A = list(map(int, input().split()))

    dp = [[0] * N for i in range(N)]

    def so(A):
        for i in range(N):
            for j in range(i - 1, -1, -1):
                dp[i][j] = 0
                for k in range(j, -1, -1):
                    if A[i] - A[j] > A[j] - A[k] and A[i] > A[j] >= A[k]:
                        dp[i][j] = max(dp[i][j], dp[j][k] + 1)
        return [max(dpi) for dpi in dp]

    f = so(A)
    r = so(A[::-1])[::-1]

    print(max(a + b for a, b in zip(f, r)) + 1)


def solve():
    T = int(input())
    for i in range(T):
        sol()


if __name__ == '__main__':
    solve()