#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main(){
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<pair<int,int>> b(n+1);
    b[n].first = 1'000'000'001;
    vector<mint> dp(n+1,0);
    dp[n] = 1;
    for (int i = n-1; i >= 0; i--){
        if (b[i+1].first >= a[i]){
            b[i] = make_pair(a[i],i);
        }
        else {
            b[i] = b[i+1];
        }
        int l = b[i].second;
        mint cur = dp[l+1];
        dp[i] = dp[i+1] + cur;
        if (i == 0){
            cout << cur.val() << endl;
        }
    }
}