import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 2 1 99998 1 0 9 31 41 59 26 53 58 97 93 23 """ mod=998244353 class BIT: def __init__(self, n): self._n = n self.data = [0] * n def add(self, p, x): assert 0 <= p < self._n p += 1 while p <= self._n: self.data[p - 1] = (self.data[p - 1]+x)%mod p += p & -p #合計にはrを含まない def sum(self, l, r): assert 0 <= l <= r <= self._n return (self._sum(r) - self._sum(l))%mod def _sum(self, r): s = 0 while r > 0: s = (s+self.data[r - 1])%mod r -= r & -r return s #pの位置をxという値にセット def set(self, p, x): self.add(p, (-self.sum(p, p+1) + x)%mod) def input(): return sys.stdin.readline()[:-1] def solve(test): N=int(input()) A=list(map(int, input().split())) bit=[0]*(10**5+2) bit[A[0]]=1 for i in range(N-1): bit2=[0]*(10**5+2) tmp=0 for j in range(10**5+1): tmp+=bit[j] bit2[min(10**5+1,max(j,j-A[i]+A[i+1]))]+=tmp bit2[min(10**5+1,max(j,j-A[i]+A[i+1]))]%=mod bit=bit2 ans=0 tmp=0 for i in range(10**5+1): tmp+=bit[i] ans=(ans+tmp)%mod print(ans) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)