#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 998244353;

ll mod_pow(ll a, ll n){
    ll res = 1;
    while(n > 0){
        if(n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

ll mod_inv(ll a){
    return mod_pow(a, mod - 2);
}

int main(){
    int n;
    cin >> n;
    int r = 0;
    for(int i = 0; i < n; i++){
        int a;
        cin >> a;
        r += a;
    }

    cout << min(r, n - r) * mod_inv(n) % mod << endl;
}