//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
int a[200200];
int bit[200200];
int dp1[200200],dp2[200200];
void update(int p,int v)
{
	while(p<200200)
	{
		bit[p]=max(bit[p],v);
		p+=(p&(-p));
	}
}
int query(int p)
{
	int ans=0;
	while(p)
	{
		ans=max(ans,bit[p]);
		p-=(p&(-p));
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=1;i<=n;i++)
			cin>>a[i];
		memset(bit,0,sizeof(int)*(n+10));
		for(int i=1;i<=n;i++)
		{
			dp1[i]=query(a[i])+1;
			update(a[i],dp1[i]);
		}
		memset(bit,0,sizeof(int)*(n+10));
		for(int i=1;i<=n;i++)
		{
			dp2[i]=query(n+1-a[i])+1;
			update(n+1-a[i],dp2[i]);
		}
		int ans=*max_element(dp1+1,dp1+n+1)+*max_element(dp2+1,dp2+n+1);
		cout<<ans-1<<'\n';
	}
	return 0;
}