#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 0, 1, 0};
const int dy[4] = { 0, 1, 0, -1};
const int inf = 1e9 + 7;
const ll infll = 1e18;
//const double pi = acos(-1);
     
using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;

const int SIZE = 400010;
ll powll(ll n, ll x) {
    // return n ^ x;
    ll ret = 1;
    rep(i, x) ret *= n;
    return ret;
}
ll ceil(ll x, ll m){
    if(m < 0) x = -x, m = -m;
    
    if(x >= 0) return (x + m - 1) / m;
    else return x / m;
}
ll floor(ll x, ll m){
    if(m < 0) x = -x, m = -m;
    
    if(x >= 0) return x / m;
    else return (x - m + 1) / m;
}
void OutputYesNo(bool val) {
    if (val) cout << "Yes" << endl;
    else cout << "No" << endl;
}
void OutputTakahashiAoki(bool val) {
    if (val) cout << "Takahashi" << endl;
    else cout << "Aoki" << endl;
}
void OutPutInteger(ll x) { cout << x << endl; }
void OutPutString(string x) { cout << x << endl; }

int pop_count(ll n){
    int ret = 0;
    while(n > 0){
        if(n % 2 == 1) ret++;
        n /= 2; 
    }
    return ret; 
}

bool inrange(ll from, ll to, ll val){
    // from <= val <= to であれば、trueを返す

    return from <= val && val <= to;
}

using PAIR_REV_PQ = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;
typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;
//typedef modint mint;
//typedef vector<mint> ModintVec;
//typedef vector<Modin

mint dp[210][100010];
mint sum[100010];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    const int ma = 100000;
    
    rep2(i, a[0], ma) dp[0][i] = 1;
    rep(i, n - 1){
        rep2(j, 0, ma){
            if(j == 0) sum[j] = dp[i][j];
            else sum[j] = sum[j - 1] + dp[i][j]; 
        }

        rep2(j, a[i + 1], ma){
            dp[i + 1][j] += sum[j - max(0, a[i + 1] - a[i])];
        }
    }

    mint res = 0;
    rep2(j, 0, ma) res += dp[n - 1][j];
    cout << res.val() << endl; 

    // ai <= j <= ai + 10^5
    // ai <= j <= 10^5
}