#include "bits/stdc++.h"
    using namespace std;

    #define REP(i, n) for(ll i = 0;i < n;i++)
    #define REPR(i, n) for(ll i = n;i >= 0;i--)
    #define FOR(i, m, n) for(ll i = m;i < n;i++)
    #define FORR(i, m, n) for(ll i = m;i >= n;i--)
    #define REPO(i, n) for(ll i = 1;i <= n;i++)
    #define ll long long
    #define INF (ll)1ll << 60
    #define MINF (-1 * INF)
    #define ALL(n) n.begin(),n.end()
    #define MOD (ll)1000000007
    #define P pair<ll, ll>

    ll mod = 998244353;
    ll powmod(ll a, ll b, ll mod = 1e9+7) {
        a %= mod;
        ll res = 1;
        while (b > 0) {
            if (b % 2 == 1)res = res * a % mod;
            a = a * a % mod;
            b /= 2;
        }
        return res;
    }

    int main(){
        ll n, cnt = 0;
        cin >> n;
        REP(i, n){
            ll a;
            cin >> a;
            if(a)cnt++;
        }
        cout << min(cnt * powmod(n, mod - 2, mod) % mod, (n - cnt) * powmod(n, mod - 2, mod) % mod) << endl;
    }