#include<bits/stdc++.h>
using namespace std;
constexpr int N=10005,mod=998244353;
int n,a[N],dp[N][N];
inline void red(int&x){x>=mod&&(x-=mod);}
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=0;i<=a[n];i++)dp[0][i]=1;
    for(int i=1,pos=1;i<=a[n]+1;i++){
        long long res=1;
        int cur=a[pos]/2+1;
        if(a[pos]+1!=i){for(int j=0;j<=a[n];j++)red(dp[i][j]=dp[i-1][j]+mod-(i>1?dp[i-2][j]:0));goto cinema;}
        for(int k=a[pos]/2+1;k<=a[pos];k++) res+=dp[k][a[pos]-k+1]-dp[k-1][a[pos]-k+1];
        res=(res%mod+mod)%mod;
        dp[i][0]=(res%=mod);
        for(int j=1;j<=a[pos];j++){
            if(j>cur) res-=dp[cur][max(j,a[pos]-cur+1)]-dp[cur-1][max(j,a[pos]-cur+1)],cur++;
            int ps=max(a[pos]-j+2,cur)-1;
            res+=dp[a[pos]][j]-dp[ps][j]-dp[a[pos]][j-1]+dp[ps][j-1];
            res=(res%mod+mod)%mod;
            dp[i][j]=res;
        }
        for(int j=a[pos]+1;j<=a[n];j++) dp[i][j]=1;
        pos++;
        cinema:
        for(int j=0;j<=a[n];j++) red(dp[i][j]+=dp[i-1][j]);
    }
    cout<<(dp[a[n]+1][0]-dp[a[n]][0]+mod)%mod<<'\n';
}