#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = (long long)(ret) * (x) % MOD;
    x = (long long)(x) * (x) % MOD;
    y >>= 1;
  }
  return ret;
}
void checkmin(int &x, int y) {
  if (x > y) x = y;
}
void checkmax(int &x, int y) {
  if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
  if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
  if (x < y) x = y;
}
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return x * f;
}
const int N = 2000005;
const int M = 100005;
int k, a[M], n, p[N], fac[N], ifac[N];
void init() {
  fac[0] = 1;
  n = k + 1000000;
  for (int i = 1; i <= n; i++) fac[i] = (long long)(fac[i - 1]) * (i) % MOD;
  ifac[n] = qpow(fac[n], MOD - 2);
  for (int i = n - 1; i >= 0; i--)
    ifac[i] = (long long)(ifac[i + 1]) * (i + 1) % MOD;
  for (int i = 1; i <= k; i++) {
    for (int j = a[i] + 1; j <= n; j += k) p[j]++;
  }
  for (int i = 1; i <= n; i++) {
    p[i] = add(p[i], p[i - 1]);
    if (p[i] > i) n = i - 1;
  }
}
int C(int n, int m) {
  if (n < m) return 0;
  return (long long)(fac[n]) * ((long long)(ifac[n - m]) * (ifac[m]) % MOD) %
         MOD;
}
int main() {
  int zero = 0, mx = 0;
  k = read();
  for (int i = 1; i <= k; i++)
    a[i] = read(), zero += (a[i] == 0), checkmax(mx, a[i]);
  if (zero >= 2) {
    puts("1");
    return 0;
  }
  init();
  int ans = 0;
  for (int i = n - k + 1; i <= n; i++) {
    if (i < 0) continue;
    Add(ans, C(i + k - 1 - p[i], k - 1));
  }
  cout << ans << endl;
  return 0;
}
