#include <bits/stdc++.h>
using namespace std;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() { return abs((int)mt()); }
inline int mrand(int k) { return abs((int)mt()) % k; }
void chemthan() {
  int n;
  cin >> n;
  vector<int> a(n);
  int sa = 0;
  for (int i = (0); i < (n); ++i) cin >> a[i], sa += a[i];
  vector<pair<int, int> > dp(sa + 1);
  dp[0] = make_pair(1, 0);
  dp[1].first = 1;
  submod(dp[1].second, n - 1);
  for (int x = (1); x < (sa); ++x) {
    int px = mult(x, inv(sa));
    int a = 1;
    submod(a, mult(1 - px + MOD, mult(n - 2, inv(n - 1))));
    int b = px;
    int c = mult(1 - px + MOD, inv(n - 1));
    dp[x + 1].first = mult(a, dp[x].first);
    submod(dp[x + 1].first, mult(b, dp[x - 1].first));
    dp[x + 1].first = mult(dp[x + 1].first, inv(c));
    dp[x + 1].second = mult(a, dp[x].second);
    submod(dp[x + 1].second, mult(b, dp[x - 1].second));
    submod(dp[x + 1].second, 1);
    dp[x + 1].second = mult(dp[x + 1].second, inv(c));
  }
  int t = mult(MOD - dp[sa].second, inv(dp[sa].first));
  int res = 0;
  for (int i = (0); i < (n); ++i) {
    int x = mult(dp[a[i]].first, t);
    addmod(x, dp[a[i]].second);
    addmod(res, x);
  }
  submod(res, mult(t, n - 1));
  res = mult(res, inv(n));
  cout << res << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
