#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10, mod = 998244353;
int rd() {
  int x = 0, w = 1;
  char ch = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch ^ 48);
    ch = getchar();
  }
  return x * w;
}
void ad(int &x, int y) { x += y, x -= x >= mod ? mod : 0; }
int fpow(int a, int b) {
  int an = 1;
  while (b) {
    if (b & 1) an = 1ll * an * a % mod;
    a = 1ll * a * a % mod, b >>= 1;
  }
  return an;
}
int ginv(int a) { return fpow(a, mod - 2); }
int n, m, mx, a[N], c[N], b[N], fac[N], iac[N];
int C(int a, int b) {
  return b < 0 || a < b ? 0 : 1ll * fac[a] * iac[b] % mod * iac[a - b] % mod;
}
int main() {
  fac[0] = 1;
  for (int i = 1; i <= N - 5; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
  iac[N - 5] = ginv(fac[N - 5]);
  for (int i = N - 5; i; --i) iac[i - 1] = 1ll * iac[i] * i % mod;
  n = rd();
  for (int i = 1; i <= n; ++i) {
    a[i] = rd();
    mx = max(mx, a[i]), ++c[a[i]];
  }
  for (int i = 1, s = 0; i <= n; ++i) {
    s += c[i - 1];
    if (s > i) break;
    ++m;
  }
  int ans = 0;
  if (m < n) {
    for (int i = 0, s = 0; i <= m; ++i) {
      ad(ans, C(i - s + n - 1, n - 1));
      s += c[i];
    }
  } else {
    int s = 0;
    for (int i = 1; i <= n; ++i) {
      s += max((mx - 1 - a[i] + n) / n, 0);
      if (a[i] != mx) ++b[a[i] % n];
    }
    for (int i = n, j = mx; i; --i, --j) {
      ad(ans, C(j - s + n - 1, n - 1));
      s -= b[(j + n - 1) % n], b[(j + n - 1) % n] -= j ? c[j - 1] : 0;
    }
  }
  printf("%d\n", ans);
  return 0;
}
