#include<bits/stdc++.h>
#define N 100005
using namespace std;
int ct[N],tr[N],n,a[N],tr1[N],tr2[N],f[N][20],g[N][20],dp[N];
int qry(int x,int v){
	for(int i=19;i>=0;--i)
		if(x+(1<<i)-1<=n&&g[x][i]>v)x+=(1<<i);
	return x;
}
int qry1(int x,int v){
	for(int i=19;i>=0;--i)
		if(x+(1<<i)-1<=n&&f[x][i]<v)x+=(1<<i);
	return x;
}
int st[N],tl,st1[N],tl1;
void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]),tr1[i]=tr2[i]=0,f[i][0]=g[i][0]=a[i];
	for(int j=1;(1<<j)<=n;++j)
		for(int i=1;i+(1<<j)-1<=n;++i)
			f[i][j]=max(f[i][j-1],f[i+(1<<j-1)][j-1]),
			g[i][j]=min(g[i][j-1],g[i+(1<<j-1)][j-1]);
	tl=tl1=0;
	for(int i=n;i;--i){
		while(tl&&a[st[tl]]<a[i])tr1[st[tl--]]=0;
		if(tl)tr1[st[tl]]=min(tr[st[tl]],qry(st[tl],a[i])-1);st[++tl]=i;
		while(tl1&&a[st1[tl1]]>a[i])tr2[st1[tl1--]]=0;
		if(tl1)tr2[st1[tl1]]=min(tr[st1[tl1]],qry1(st1[tl1],a[i])-1);st1[++tl1]=i;
		for(int j=i;j<=n;++j)ct[j]=0;
		for(int j=i;j<=n;++j){
			if(tr1[j])++ct[j-1],--ct[tr1[j]+1];
			if(tr2[j])++ct[j-1],--ct[tr2[j]+1];
		}tr[i]=dp[i]=0;
		for(int j=i+1;j<=n;++j){
			ct[j]+=ct[j-1];
			if(!ct[j]){tr[i]=j-1;break;}
		}if(!tr[i])tr[i]=n;
//		cout<<i<<" "<<tr[i]<<endl;
	}
	dp[0]=0;int ans=0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<i;++j)if(tr[j]>=i)dp[i]=max(dp[i],dp[j-1]+i-j);
		ans=max(ans,dp[i]);
	}printf("%d\n",ans);
}
int main(){
	int T;cin>>T;
	while(T--)solve();
	return 0;
}