#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353, N_MAX = 1e5, M_MAX = 3e5;
int a[N_MAX];
long long e[M_MAX + 2], f[M_MAX + 2], n, m;
long long mod_pow(long long a, int k) {
  long long b = 1;
  while (k) {
    if (k % 2) b = b * a % MOD;
    a = a * a % MOD;
    k /= 2;
  }
  return b;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) m += a[i];
  long long inv1 = mod_pow(n - 1, MOD - 2), inv2 = mod_pow(m, MOD - 2);
  f[m] = 1;
  for (int k = m; 0 < k; k--) {
    long long d = m * (n - 1) % MOD * mod_pow(k, MOD - 2) % MOD,
              p = (MOD + 1 - k * (n - 2) % MOD * inv1 % MOD * inv2 % MOD) % MOD,
              q = (MOD - (m - k) * inv2 % MOD) % MOD;
    e[k - 1] = (MOD - 1 + p * e[k] + q * e[k + 1]) % MOD * d % MOD;
    f[k - 1] = (p * f[k] + q * f[k + 1]) % MOD * d % MOD;
  }
  long long x = (MOD - e[0]) * mod_pow(f[0], MOD - 2) % MOD;
  for (int k = 0; k <= m; k++) e[k] = (e[k] + f[k] * x) % MOD;
  long long sol = MOD - (n - 1) * e[m] % MOD;
  for (int i = 0; i < n; i++) sol += e[m - a[i]];
  sol = sol % MOD * mod_pow(n, MOD - 2) % MOD;
  cout << sol << "\n";
  return 0;
}
