mod = 998244353

N = int(input())
assert 1 <= N <= 200
A = list(map(int, input().split()))
for i in range(N):
    assert 0 <= A[i] <= 100000

dp = [[0 for _ in range(100001)] for _ in range(N)]
for i in range(A[0], 100001):
    dp[0][i] = 1
for i in range(1, N):
    diffs = max(0, A[i] - A[i - 1])
    now_sum = 0
    for j in range(100001):
        if j >= diffs:
            now_sum = (now_sum + dp[i - 1][j - diffs]) % mod
        dp[i][j] = now_sum
ans = 0
for i in range(100001):
    ans = (ans + dp[N - 1][i]) % mod
print(ans)