#include <bits/stdc++.h>
int read() {
  int r = 0, t = 1, c = getchar();
  while (c < '0' || c > '9') {
    t = c == '-' ? -1 : 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    r = r * 10 + c - 48;
    c = getchar();
  }
  return r * t;
}
const int N = 1000010, mod = 998244353;
long long n, f[N], F[N], m;
long long a[N], c[N];
long long ans;
long long power(long long a, long long b, long long p) {
  long long r = 1;
  for (; b; b >>= 1, a = a * a % p)
    if (b & 1) r = r * a % p;
  return r;
}
long long C(long long a, long long b) {
  return f[a] * F[b] % mod * F[a - b] % mod;
}
long long Q(long long a, long long b) { return C(a + b - 1, a - 1); }
int main() {
  n = 1000000;
  f[0] = 1;
  for (int i = (1), end_i = (n); i <= end_i; i++) f[i] = f[i - 1] * i % mod;
  F[n] = power(f[n], mod - 2, mod);
  for (int i = (n), end_i = (1); i >= end_i; i--) F[i - 1] = F[i] * i % mod;
  n = read();
  for (int i = (1), end_i = (n); i <= end_i; i++) m += (a[i] = read());
  for (int i = (1), end_i = (n); i <= end_i; i++) c[a[i]]++;
  for (int i = (1), end_i = (m); i <= end_i; i++) c[i] += c[i - 1];
  std::sort(a + 1, a + n + 1);
  int flag = 0;
  for (int i = (1), end_i = (n); i <= end_i; i++)
    if (c[i - 1] > i) {
      flag = 1;
      break;
    }
  if (flag) {
    ans = 1;
    for (int i = (1), end_i = (n); i <= end_i; i++)
      if (c[i - 1] <= i)
        ans += Q(n, i - c[i - 1]);
      else
        break;
  } else {
    long long t = 0;
    memset(c, 0, sizeof(c));
    for (int i = (1), end_i = (n); i <= end_i; i++) {
      c[a[i] % n]++;
      t += a[i] % n;
    }
    for (int i = (0), end_i = (n - 1); i <= end_i; i++) {
      ans += Q(n, (m - t) / n);
      t -= n;
      t += c[i] * n;
    }
  }
  printf("%lld\n", ans % mod);
  return 0;
}
