import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines
import numpy as np
t=int(readline())
def solve():
    n=int(readline())
    a=list(map(int, readline().split()))
    dp=np.zeros((2, n, n), np.int16)
    ans=1
    for i in range(n):
        for j in range(i):
            if a[j]<a[i] and dp[0][j][i]==0:
                dp[0][j][i]=2
            if a[j]>a[i] and dp[1][j][i]==0:
                dp[1][j][i]=2
            if ans<dp[0][j][i]:
                ans=dp[0][j][i]
            if ans<dp[1][j][i]:
                ans=dp[1][j][i]
            if dp[0][j][i]>0:
                for k in range(i+1, n):
                    if a[i]-a[j]<a[k]-a[i] and dp[0][i][k]<dp[0][j][i]+1:
                        dp[0][i][k]=dp[0][j][i]+1
                    if a[i]>a[k] and dp[1][i][k]<dp[0][j][i]+1:
                        dp[1][i][k]=dp[0][j][i]+1
            if dp[1][j][i]>0:
                for k in range(i+1, n):
                    if a[i]>a[k] and a[j]-a[i]>a[i]-a[k] and dp[1][i][k]<dp[1][j][i]+1:
                        dp[1][i][k]=dp[1][j][i]+1
    print(ans)                        
for _ in range(t):
    solve()