#include <stdio.h>

const int Mod = 998244353;

int main()
{
	int i, N, A[201];
	scanf("%d", &N);
	for (i = 1, A[0] = 0; i <= N; i++) scanf("%d", &(A[i]));
	
	int j, jj, cur, prev;
	long long dp[2][100001] = {}, sum[100001];
	for (i = 1, cur = 1, prev = 0, dp[0][0] = 1; i <= N; i++, cur ^= 1, prev ^= 1) {
		for (j = 1, sum[0] = dp[prev][0], dp[prev][0] = 0; j <= 100000; j++) {
			sum[j] = (sum[j-1] + dp[prev][j]) % Mod;
			dp[prev][j] = 0;
		}
		if (A[i-1] > A[i]) {
			for (j = 0; j < A[i-1] - A[i]; j++) dp[cur][j] = 0;
			for (; j <= 100000 - A[i]; j++) dp[cur][j] = sum[j - A[i-1] + A[i]];
		} else {
			for (j = 0; j <= 100000 - A[i]; j++) dp[cur][j] = sum[j];
		}
		for (; j <= 100000; j++) dp[cur][j] = 0;
	}
	
	long long ans = 0;
	for (j = 0; j <= 100000; j++) ans += dp[prev][j];
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}