#include<iostream>
#include<stdio.h>
#include<string.h>
#include<set>
#include <stack>
#include<queue>
#include<algorithm>
#include<cmath>
#define oo 1000000007
#define ll long long
#define pi acos(-1.0)
#define MAXN 300005
using namespace std;
int dp[MAXN][2],P[MAXN<<2];
void update(int t,int l,int r,int x,int now)
{
if (l==r)
{
P[now]=max(P[now],x);
return;
}
int mid=l+r>>1;
if (t<=mid) update(t,l,mid,x,now<<1);
if (t>mid) update(t,mid+1,r,x,now<<1|1);
P[now]=max(P[now<<1],P[now<<1|1]);
}
int query(int L,int R,int l,int r,int now)
{
if (L<=l && R>=r) return P[now];
int ans=0,mid=l+r>>1;
if (L<=mid) ans=max(ans,query(L,R,l,mid,now<<1));
if (R>mid) ans=max(ans,query(L,R,mid+1,r,now<<1|1));
return ans;
}
int D[MAXN],A[MAXN];
int Bsearch(int x,int n)
{
int l=0,r=n+1,mid;
while (r-l>1)
{
mid=l+r>>1;
if (D[mid]>x) r=mid;
else l=mid;
}
return l;
}
int main()
{
int cases,i,n,x,ans;
scanf("%d",&cases);
while (cases--)
{
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&A[i]),D[i]=A[i];
sort(D+1,D+1+n);
memset(dp,0,sizeof(dp));
memset(P,0,sizeof(P));
ans=0;
for (i=1;i<=n;i++)
{
x=Bsearch(A[i],n);
if (A[i]>A[i-1])
dp[i][0]=dp[i-1][0]+1,dp[i][1]=dp[i-1][1]+1;
else dp[i][0]=dp[i][1]=1;
update(x,0,n,dp[i][0],1);
dp[i][1]=max(dp[i][1],query(0,x-1,0,n,1)+1);
ans=max(ans,max(dp[i][0],dp[i][1]));
}
printf("%d\n",ans);
}
return 0;
}