#include<stdio.h>
#include<iostream>
#include<algorithm>
#define inf 0X7fffffff
#define int long long
using namespace std;
const int N=2e6+9;
const int p=998244353;
int read(int &x){
    int dat=0,oko=1;char chc=getchar();
    while(chc<'0'||chc>'9'){if(chc=='-')oko=-1;chc=getchar();}
    while(chc>='0'&&chc<='9'){dat=dat*10+chc-'0';chc=getchar();}
    x=dat*oko;return x;
}int n,a[N],head[N],siz[N],tot,ans,st[N];
int tree[N],sum;
int lowbit(int x){return x&(-x);}
void add(int x,int val){
    while(x<=n){
        tree[x]+=val;
        x+=lowbit(x);
    }
}int query(int x){
    int res=0;
    while(x){
        res+=tree[x];
        x-=lowbit(x);
    }return res;
}int quick(int x,int k){
    int res=1,base=x;
    while(k){
        if(k&1)res=res*base%p;
        base=base*base%p;k>>=1;
    }return res;
}int self(int x){
    x--;if(x)x--;
    return (((x+1)*x)>>1);
}
signed main(){
    read(n);st[0]=1;ans=1;
    for(int i=1;i<N;i++)st[i]=(st[i-1]<<1)%p;
    for(int i=1;i<=n;i++){
        read(a[i]);
        if(a[i]>a[i-1]){
            head[++tot]=a[i];
            siz[tot]=1;
        }else siz[tot]++;
    }for(int i=tot;i>=1;i--){
        int temp=query(head[i]);
        ans=ans*quick(st[siz[i]]-1,temp)%p;
        ans=ans*quick(st[sum-temp],siz[i])%p;
        ans=ans*quick(2,self(siz[i]))%p;
        sum+=siz[i];add(head[i],1-temp);
    }printf("%lld\n",ans%p);
    return 0;
}