#include<cstdio>
#include<cstring>
#include<algorithm>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using std::min;
using std::max;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const ll mod=998244353;
const int NV=100;
int fac[NV+5];

namespace xm{
    int f[2][105][10005];
    void _(){
        int N,sum=0;

        fac[0]=1;
        for(ll i=1;i<NV+5;++i) fac[i]=fac[i-1]*i%mod;

        scanf("%d",&N);
        f[0][0][0]=1;
        for(int i=1;i<=N;++i){
            int cur=i&1,lst=cur^1,a;
            scanf("%d",&a);
            sum+=a;
            memcpy(f[cur],f[lst],sizeof*f);
            for(int k=i;k;--k)
            for(int j=10000;j>=a;--j)
                f[cur][k][j]=(f[cur][k][j]+f[lst][k-1][j-a])%mod;
        }
        if(sum&1){
            puts("0");
            return;
        }
        ll ans=0;
        for(int i=1;i<N;++i)
            ans=(ans+(ll)fac[i]*fac[N-i]%mod*f[N&1][i][sum/2])%mod;
        printf("%lld\n",ans);
    }
}

int main(){
    xm::_();
    return 0;
}