#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;}
const double eps = 1e-10;


int main() {
    ll n;
    scanf("%lld", &n);

    ll sum = 1;
    for(int i = 2; i<=n; i++) {
        int value = i;
        for(int j=i-1; j>1; j--) {
            if(value % j == 0) {
                value = value / j;
            }
        }
        if(i == 8) value = value * 2;
        if(i == 16) value = value * 2;
        if(i == 27) value = value * 3;
        sum *= value;
    }

    for(int i=2; i<=n; i++) {
        ll x = (sum+1) % i;
        if(x != 1) printf("no!!! n: %lld, %d, %lld\n", n, i, x);
    }
    cout << sum + 1 << '\n';
    return 0;

}
#include <bits/stdc++.h>

using namespace std;

const int maxn = 105;
const int mod = 998244353;

int n;
int a[maxn];
int inv[maxn];
int f[maxn][maxn][maxn * maxn];

int binpow(int x, int y) {
    int ans = 1;
    while(y) {
        if (y & 1) ans = 1ll * ans * x % mod;
        y >>= 1;
        x = 1ll * x * x % mod;
    }
    return ans;
}

void add(int &x, int y) {
    x += y;
    if (x >= mod) x -= mod;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int sum = 0, prod = 1;

    for(int i = 1; i < maxn; ++i) {
        inv[i] = binpow(i, mod - 2);
    }

    cin >> n;
    for(int i = 0; i < n; ++i) cin >> a[i], sum += a[i], prod = 1ll * prod * (i + 1) % mod;

    if (sum % 2 == 1) {
        cout << 0 << endl;
        return 0;
    }

    f[0][0][0] = prod;

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j <= i; ++j) {
            for(int s = 0; s < maxn * maxn; ++s) {
                if (f[i][j][s] == 0) continue;
                add(f[i + 1][j][s], f[i][j][s]);
                add(f[i + 1][j + 1][s + a[i]], 1ll * f[i][j][s] * (j + 1) % mod * inv[n - j] % mod);
            }
        }
    }

    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        ans += f[n][i][sum / 2];
        ans = (ans % mod);
    }

    cout << ans << endl;

    return 0;
}