#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define V vector
#define pb push_back
#define fi first
#define se second
typedef long long LL;
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;
}
LL MOD(LL x) {
    if(x >= mod) x -= mod;
    if(x < 0) x += mod;
    return x;
}
void solve(){
    int n; cin >> n;
    V<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    LL cnt2 = 0;
    LL ans = 1;
    stack<int> stk;
    for(int i = 1; i <= n; i++) {
        while(stk.size() && a[stk.top()] < a[i]) stk.pop();
        if(stk.size()) {
            ans = MOD(ans * (qpow(2, i - stk.top()) - 1) % mod);
            cnt2 += stk.top() - 1;
        } else {
            cnt2 += i - 1;
        }
        stk.push(i);
    }
    ans = ans * qpow(2, cnt2) % mod;
    cout << ans << endl;
    
    
    
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    solve();
    
}