package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

var a []int
var l, r []int

func recL(p, cnt, diff int) int {
	if p == len(a) {
		return 0
	}
	if l[p] != -1 {
		return l[p]
	}
	ret := 0
	for i := p + 1; i < len(a); i++ {
		if a[p] < a[i] && a[i]-a[p] > diff {
			ret = max(ret, recL(i, cnt+1, a[i]-a[p]))
		}
	}
	l[p] = ret + 1
	return ret + 1
}

func solve() {
	N := getInt()
	a = getInts(N)
	l = make([]int, N)
	r = make([]int, N)
	for i := 0; i < N; i++ {
		l[i] = -1
	}
	x := recL(0, 0, 0)
	for i := 0; i < len(l); i++ {
		if l[i] != -1 {
			l[i] = x - l[i]
		}
	}
	copy(r, l)

	for i := 0; i < len(a)/2; i++ {
		a[i], a[len(a)-1-i] = a[len(a)-1-i], a[i]
	}
	for i := 0; i < N; i++ {
		l[i] = -1
	}
	x = recL(0, 0, 0)
	for i := 0; i < len(l)/2; i++ {
		l[i], l[len(a)-1-i] = l[len(a)-1-i], l[i]
	}
	for i := 0; i < len(l); i++ {
		if l[i] != -1 {
			l[i] = x - l[i]
		}
	}
	ma := 0
	// out(l)
	// out(r)
	for i := 0; i < len(l); i++ {
		ma = max(ma, l[i]+r[i])
	}
	out(ma + 1)
}

func main() {
	sc.Split(bufio.ScanWords)
	T := getInt()
	for i := 0; i < T; i++ {
		solve()
	}
}