#include<bits/stdc++.h>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define vectorwyx maze
namespace vectorwyx{
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define sml(x,y) (x=min(x,y))
#define big(x,y) (x=max(x,y))
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define umap unordered_map
#define db double
#define fo(i,x,y) for(int i=(x);i<=(y);++i)
#define go(i,x,y) for(int i=(x);i>=(y);--i)
#define ptc putchar
#define gtc getchar
#define emp emplace
#define re return
#define co continue
#define brk break
#define HH (ptc('\n'))
#define bctz __builtin_ctz
#define bclz __builtin_clz
#define bppc __builtin_popcount
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
ll seed=chrono::system_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
inline int rm(int x,int y){return (int)(rnd()%(y-x+1ll)+x);}
inline int read(){signed ch=getchar();int x=0,f=1;while(!isdigit(ch)){if(ch==(int)('-'))f=-1;ch=getchar();}while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
template<typename T> void out(T *a,int l,int r){fo(i,l,r) cout<<*(a+i)<<' ';puts("");}

const int N=2e5+5,mod=998244353;
#define modS(x) x=x>=mod?x-mod:x
int a[N],n,lg[N];
pii st[21][N];
// umap<int,int> f[N];
cc_hash_table<int,int> f[N],Sl[N],Sr[N];

int F(int l,int r);
int Sum_l(int l,int r);
int Sum_r(int l,int r);

void solve(){
    cin>>n;
    fo(i,1,n) a[i]=read(),st[0][i]=mk(a[i],i),f[i].clear(),Sl[i].clear(),Sr[i].clear();
    fo(i,1,lg[n]) fo(j,1,n) st[i][j]=min(st[i-1][j],st[i-1][min(j+(1<<(i-1)),n)]);
    cout<<F(1,n)<<'\n';
}

signed main(){
    fo(i,2,N-5) lg[i]=lg[i>>1]+1;
    int T=read();
    while(T--) solve();
    return 0;
}

int rmq(int l,int r){
    int w=lg[r-l+1];
    re min(st[w][l],st[w][r-(1<<w)+1]).se;
}

int F(int l,int r){
    // printf("F(%d,%d)\n",l,r);
    if(l==r) re 1;
    if(f[l][r]) re f[l][r];
    int mid=rmq(l,r);
    if(l==mid) f[l][r]=1+Sum_l(mid+1,r);
    else if(r==mid) f[l][r]=1+Sum_r(l,mid-1);
    else f[l][r]=1+Sum_l(mid+1,r)+Sum_r(l,mid-1);
    modS(f[l][r]);
    re f[l][r];
    // if(mid==l) f[l][r]=F(l,r-1)+F(l+1,r);
    // else f[l][r]=F(l+1,r)+F(l,mid-1);
    // modS(f[l][r]);
    // re f[l][r];
}

int Sum_l(int l,int r){
    if(l==r) re 1;
    if(Sl[l][r]) re Sl[l][r];
    Sl[l][r]=F(l,r)+Sum_l(l,r-1);
    modS(Sl[l][r]);
    re Sl[l][r];
}

int Sum_r(int l,int r){
    if(l==r) re 1;
    if(Sr[l][r]) re Sr[l][r];
    Sr[l][r]=F(l,r)+Sum_r(l+1,r);
    modS(Sr[l][r]);
    re Sr[l][r];
}
}
/*
4
5
4 3 5 1 2
5
5 3 1 2 4
2
2 1
3
1 3 2
-------------------------------------------------
*/










signed main(){re vectorwyx::main();}