import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353
class Cumsum1d():
    def __init__(self, A):
        self.n = len(A)
        self.Suma = [0] * (self.n + 1)
        for i in range(self.n):
            self.Suma[i + 1] += self.Suma[i] + A[i]

    def query(self, l, r):
        #0-indexed
        return self.Suma[r] - self.Suma[l]

    def get(self, i):
        return self.Suma[i + 1] - self.Suma[i]

    def __getitem__(self, p):
        if isinstance(p, int):
            return self.get(p)
        else:
            return self.query(p.start, p.stop)
n = ii()

a = li()
maxi = 10 ** 5
dp = [0] * (maxi + 1)

for i in range(0, maxi + 1):
    if i + a[0] > maxi:
        break
    dp[i] = 1
for i in range(1, n):
    e = [0] * (maxi + 1)
    DP = Cumsum1d(dp)
    for j in range(0, maxi + 1):
        #人iが仮スコアj点を取ったとする
        #この時、si-1 <= si かつ si-1 + ai-1 <= si + ai
        #=> si-1 + ai-1 - ai <= si が成り立つ必要があるから、
        #この時人i-1の仮スコアは0以上min(j,j+ai-1-ai)以下でないといけない
        #累積和持ってDP
        if j + a[i] > maxi:
            break
        e[j] += DP[0:max(0, min(j,j+a[i]-a[i-1]) + 1)]
        e[j] %= mod
    dp = e
print(sum(dp) % mod)