//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);}
const ll mod=998244353;
int n;
int a[200200];
namespace seg
{
	#define ls (x<<1)
	#define rs (ls|1)
	int val[200200<<2];
	ll ways[200200<<2];
	void build(int x,int l,int r)
	{
		val[x]=0;
		ways[x]=0;
		if(l==r) return ;
		int mid=(l+r)/2;
		build(ls,l,mid);
		build(rs,mid+1,r);
	}
	void modify(int x,int l,int r,int p,int v,ll w)
	{
		if(l==r)
		{
			val[x]=v;
			ways[x]=w;
			return ;
		}
		int mid=(l+r)/2;
		if(p<=mid)
			modify(ls,l,mid,p,v,w);
		else
			modify(rs,mid+1,r,p,v,w);
		val[x]=max(val[ls],val[rs]);
		ways[x]=0;
		if(val[ls]==val[x])
			ways[x]+=ways[ls];
		if(val[rs]==val[x])
			ways[x]+=ways[rs];
		ways[x]%=mod;
	}
	pair<int,ll> query(int x,int l,int r,int ql,int qr)
	{
		if(l==ql&&r==qr)
			return mp(val[x],ways[x]);
		int mid=(l+r)/2;
		if(qr<=mid)
			return query(ls,l,mid,ql,qr);
		if(ql>mid)
			return query(rs,mid+1,r,ql,qr);
		auto p1=query(ls,l,mid,ql,mid),p2=query(rs,mid+1,r,mid+1,qr);
		pair<int,ll> ret;
		ret.first=max(p1.first,p2.first);
		if(ret.first==p1.first)
			ret.second+=p1.second;
		if(ret.first==p2.first)
			ret.second+=p2.second;
		ret.second%=mod;
		return ret;
	}
	#undef ls
	#undef rs
}
int f1[200200],f2[200200],f3[200200],f4[200200];
ll g1[200200],g2[200200],g3[200200],g4[200200];
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];
		seg::build(1,1,n);
		seg::modify(1,1,n,1,0,1);
		for(int i=1;i<=n;i++)
		{
			auto pr=seg::query(1,1,n,1,a[i]);
			f1[i]=pr.first+1;
			g1[i]=pr.second;
			seg::modify(1,1,n,a[i],f1[i],g1[i]);
		}
		seg::build(1,1,n);
		seg::modify(1,1,n,n,0,1);
		for(int i=1;i<=n;i++)
		{
			auto pr=seg::query(1,1,n,a[i],n);
			f2[i]=pr.first+1;
			g2[i]=pr.second;
			seg::modify(1,1,n,a[i],f2[i],g2[i]);
		}
		seg::build(1,1,n);
		seg::modify(1,1,n,1,0,1);
		for(int i=n;i>=1;i--)
		{
			auto pr=seg::query(1,1,n,1,a[i]);
			f3[i]=pr.first+1;
			g3[i]=pr.second;
			seg::modify(1,1,n,a[i],f3[i],g3[i]);
		}
		seg::build(1,1,n);
		seg::modify(1,1,n,n,0,1);
		for(int i=n;i>=1;i--)
		{
			auto pr=seg::query(1,1,n,a[i],n);
			f4[i]=pr.first+1;
			g4[i]=pr.second;
			seg::modify(1,1,n,a[i],f4[i],g4[i]);
		}
		int v1=*max_element(f1+1,f1+n+1);
		int v2=*max_element(f2+1,f2+n+1);
		ll w1=0,w2=0;
		for(int i=1;i<=n;i++)
			if(f1[i]==v1)
				w1=(w1+g1[i])%mod;
		for(int i=1;i<=n;i++)
			if(f2[i]==v2)
				w2=(w2+g2[i])%mod;
		ll tot=w1*w2%mod;
		for(int i=1;i<=n;i++)
			if(f1[i]+f2[i]+f3[i]+f4[i]==v1+v2+2)
				tot=(tot+mod-g1[i]*g2[i]%mod*g3[i]%mod*g4[i]%mod)%mod;
		if(!tot)
			v1--;
		cout<<v1+v2<<'\n';
	}
	return 0;
}