#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;

#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r + 1)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using ll = long long;
using ld = long double;

struct Edge {
    int to;
    ll w;
};

using Graph = vector<vector<int>>;
// using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
// const int INF = 2e9;

template <class T> using vc = vector<T>;
template <class T> using vv = vector<vector<T>>;
template <class T> using vvv = vector<vector<vector<T>>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;

template <class T> istream &operator>>(istream &i, vc<T> &v) {
    rep(j, 0, v.size()) i >> v[j];
    return i;
}
template <class T> ostream &operator<<(ostream &o, vc<T> &v) {
    rep(j, 0, v.size()) o << v[j] << " ";
    return o;
}

template <class T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

constexpr double EPS = 1e-9;
inline bool eq(double a, double b) { return fabs(a - b) < EPS; }
inline bool lt(double a, double b) { return a < b - EPS; }
inline bool gt(double a, double b) { return a > b + EPS; }
inline int sgn(double x) {
    if (x > EPS) return 1;
    if (x < -EPS) return -1;
    return 0;
}

int N,A[210];
ll dp[210][1<<17];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    cin>>N;
    rep(i,0,N)cin>>A[i];
    int m=100000;
    dp[0][A[0]]++;
    ll mod=998244353;
    rep(i,0,N-1){
        REP(j,1,m)dp[i][j]=(dp[i][j-1]+dp[i][j])%mod;
        REP(j,0,m){
            if(A[i]>A[i+1])dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
            else if(j+A[i+1]-A[i]<=m)dp[i+1][j+A[i+1]-A[i]]=(dp[i+1][j+A[i+1]-A[i]]+dp[i][j])%mod;
        }
    }
    REP(j,1,m)dp[N-1][j]=(dp[N-1][j-1]+dp[N-1][j])%mod;
    ll ans=0;
    REP(j,0,m)ans=(ans+dp[N-1][j])%mod;
    cout<<ans<<endl;

    return 0;
}