// Problem: No.2625 Bouns Ai
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2625
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe; 
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=2e5+9,V=1e5,Mod=998244353;
ll n,a[N],dp[205][N],sum[N];
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read();
	rep(i,1,n)a[i]=read();
	rep(i,0,V-a[i])dp[1][i]=1;
	sum[0]=dp[1][0];
	rep(j,1,V)sum[j]=(sum[j-1]+dp[1][j])%Mod;
	rep(i,2,n){
		//k<=a[i]+j-a[i-1]
		rep(j,0,V-a[i]){
			ll k=a[i]+j-a[i-1];
			k=min(k,V);
			if(k>=0)dp[i][j]=sum[min(j,k)];
		}
		sum[0]=dp[i][0];
		rep(j,1,V)sum[j]=(sum[j-1]+dp[i][j])%Mod;
	}
	write(sum[V]);
	return 0;
}