// created:  2024-09-15 10:34:58
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=505,MOD=998244353;
void reduce(int &x){(x>=MOD)&&(x-=MOD);}
int n,a[N],m,ans,f[N],g[N];
int main()
{
	read(n);
	f[0]=1;
	F(i,0,n)
	{
		read(a[i]);
		F(j,0,a[i])for(int k=m++;~k;--k)reduce(g[k+a[i]-j]+=f[k]),reduce(f[k]+=f[k+1]);
		f[0]=g[0];
		F(j,1,m+1)reduce(f[j]+=g[j]);
		memset(g,0,sizeof(int)*(m+1));
	}
	F(i,0,m+1)reduce(ans+=f[i]);
	printf("%d\n",ans);
	return 0;
}