#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

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 lim = 100000;
	vector dp(n, vector<mint>(lim + 2));
	rep2(i, a[0], lim + 1) {
		dp[0][i] = 1;
	}
	rep(i, n - 1) {
		rep(j, lim + 1) {
			if (0 == dp[i][j])continue;
			int preb = j - a[i];
			int l = max(preb + a[i + 1], j);
			int r = lim;
			if (l > r)continue;
			dp[i + 1][l] += dp[i][j];
			dp[i + 1][r + 1] -= dp[i][j];
		}
		rep(j, lim) {
			dp[i + 1][j + 1] += dp[i + 1][j];
		}
	}
	mint ans = 0;
	rep(i, lim + 1)ans += dp[n - 1][i];
	cout << ans.val() << endl;
	return 0;
}