#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
T = int(readline())


# %%
def calc_from_left(A):
    N = len(A)
    dp = [[0] * (i + 1) for i in range(N)]
    for i in range(N):
        for j in range(i):
            for k in range(j + 1):
                if not (A[i] > A[j] >= A[k]):
                    continue
                if A[i] - A[j] > A[j] - A[k]:
                    x = dp[j][k] + 1
                    if dp[i][j] < x:
                        dp[i][j] = x
    return [max(x) for x in dp]


def solve():
    N = int(readline())
    A = tuple(map(int, readline().split()))
    dp1 = calc_from_left(A)
    dp2 = calc_from_left(A[::-1])[::-1]
    return max(x + y for x, y in zip(dp1, dp2)) + 1


# %%
for _ in range(T):
    print(solve())