#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
map<ll,ll> dp1,dp2;
set<ll> se;

void solve(){
    dp1[0] = 0;
	ll n;
    cin >> n;
    for(ll i=0;i<n;i++){
		ll a;
        cin >> a;
        se.insert(a);
        dp2[a] = dp2[a]+1;
        dp1[a] = (dp1[a]+dp1[a-1]+dp2[a-1])%mod;
    }
    ll cnt = 0;
    for(auto i:se){
        cnt = (cnt+dp1[i])%mod;
    }
    cout << cnt;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    solve();
}