#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=5e5;
const int mod=998244353;
int ksm(ll x,int tp,int s=1){
    for(;tp;x=x*x%mod,tp>>=1) if(tp&1) s=x*s%mod;
    return s;
}
int n;
int p[N+5];
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&p[i]);
    ll s=1ll*n*(n-1)/2;
    for(int i=2;i<=n;i++)
        if(p[i]<p[i-1]) s--;
    printf("%d\n",ksm(2,s%(mod-1)));
    return 0;
}