#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=998244353;
ll qpow(ll a,ll b){
    if(b==0)return 1;
    ll ans=1;
    if(b%2)ans=a;
    ll t=qpow(a,b/2);
    return t*t%mod*ans%mod;
}
void solve(){
    int n;
    cin>>n;
    vector<int>a(n+1);
    ll cnt=(ll)n*(n-1)/2;
    for(int i=1;i<=n;i++)cin>>a[i];
    int premax=0;
    for(int i=1;i<=n;i++){
        if(a[i]>premax){
            premax=a[i];
            cnt++;
        }
    }
    cnt-=n;
    cout<<qpow(2,cnt)<<'\n';
    
    
    
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    solve();
    
}