N=int(input())
A=list(map(int, input().split()))
c=10**5+1
mod=998244353
for i in range(N):
  a=A[i]
  if i==0:
    dp=[0]*c
    for j in range(c-a):
      dp[j+a]=1
  else:
    D=[0];aa=A[i-1]
    for d in dp:
      D.append(D[-1]+d)
    ndp=[0]*c
    for j in range(a,c):
      d=min(j,j-a+aa)
      if d>=0:
        ndp[j]+=D[d+1] 
        ndp[j]%=mod
    dp=ndp 
print(sum(dp)%mod)