#include <iostream>

using namespace std;
typedef long long ll;
ll mod = 998244353,dp[5010][5010] = {},sum[5010][5010] = {},a[5010],l[5010],r[5010];
int main(){
    int i,j,n; cin >> n;
    for(i=1;i<=n;i++) cin >> a[i];
    a[0] = 0,a[n + 1] = n + 1;
    for(i=1;i<=n;i++){
        l[i] = r[i] = -1;
        for(j=i - 1;j>=1;j--){
            if(a[j]<a[i]){
                l[i] = j + 1; break;
            }
        }
        for(j=i + 1;j<=n;j++){
            if(a[j]<a[i]){
                r[i] = j - 1; break;
            }
        }
        if(l[i]==-1) l[i] = 1;
        if(r[i]==-1) r[i] = n;
    }
    dp[0][0] = dp[1][0] = 1;
    for(j=0;j<=n;j++) sum[0][j] = 1;
    for(i=1;i<=n;i++){
        for(j=l[i];j<=r[i];j++){
            (dp[i][j] += sum[i - 1][j - 1]) %= mod;
            if(l[i]>=2) (dp[i][j] += mod - sum[i - 1][l[i] - 2]) %= mod;
        }
        for(j=0;j<=n;j++) dp[i + 1][j] = dp[i][j];
        sum[i][0] = dp[i][0];
        for(j=1;j<=n;j++) (sum[i][j] += sum[i][j - 1] + dp[i][j]) %= mod;
    }
    cout << dp[n][n] << endl;
}