#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e6 + 10, lim = 2e6, mod = 998244353;
int a[maxN + 1], n, mx, cnt[maxN + 1], s[maxN + 1];
int fac[maxN + 1], inv[maxN + 1];
inline int read() {
  int num = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) num = (num << 3) + (num << 1) + (ch ^ 48), ch = getchar();
  return num * f;
}
inline int ADD(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
inline int SUB(int x, int y) { return x - y < 0 ? x - y + mod : x - y; }
inline int mpow(int a, int x) {
  int ans = 1;
  while (x) {
    if (x & 1) ans = 1ll * ans * a % mod;
    a = 1ll * a * a % mod;
    x >>= 1;
  }
  return ans;
}
inline int C(int n, int m) {
  if (n < m) return 0;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    mx = max(mx, a[i]);
    s[a[i] + 1]++;
  }
  fac[0] = 1;
  for (int i = 1; i <= lim; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[lim] = mpow(fac[lim], mod - 2);
  for (int i = lim - 1; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  for (int i = 1; i <= n; i++)
    for (int j = a[i] + 1; j <= mx; j += n) cnt[j]++;
  int t = 0, ans = 1, last = n;
  for (int i = 1; i <= mx; i++) {
    t += 1 - cnt[i], last -= s[i];
    if (t < 0) break;
    ans = ADD(ans, SUB(C(t + n - 1, n - 1), C(t + n - last - 1, n - 1)));
  }
  printf("%d", ans);
  return 0;
}
