#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    vector<vector<ll>> dp(N,vector<ll>(100500,0));
    rep(j,100500) if(j>=A[0]) dp[0][j]=1;
    rep(i,N-1){
        vector<ll> cum(100500,0);
        cum[0]=dp[i][0];
        rep(j,100500-1) cum[j+1]=(cum[j]+dp[i][j+1])%mod;
        rep(j,100500){
            if(j<A[i+1]) continue;
            if(A[i]<A[i+1]) dp[i+1][j]=cum[j-A[i+1]+A[i]];
            if(A[i]>=A[i+1]) dp[i+1][j]=cum[j];
        }
    }
    ll ans=0;
    rep(j,100000+1) ans+=dp[N-1][j];
    cout << ans%mod << endl;
    return 0;
}