#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int mod = 998244353;
const int maxn = 100100;
int arr[maxn], nxtbig[maxn];
long long fac[maxn * 11], invfac[maxn * 11];
long long dp[maxn * 11];
int n;
long long c(int a, int b) {
  if (a < b) return 0;
  return fac[a] * invfac[a - b] % mod * invfac[b] % mod;
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", arr + i);
  fac[0] = 1;
  for (int i = 1; i < maxn * 11; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  invfac[maxn * 11 - 1] = pow(fac[maxn * 11 - 1], mod - 2, mod);
  for (int i = maxn * 11 - 2; i >= 0; i--) {
    invfac[i] = invfac[i + 1] * (i + 1) % mod;
  }
  sort(arr, arr + n);
  nxtbig[n - 1] = n;
  for (int i = n - 2; i >= 0; i--) {
    if (arr[i + 1] > arr[i])
      nxtbig[i] = i + 1;
    else
      nxtbig[i] = nxtbig[i + 1];
  }
  int zero_idx = n - 1;
  for (int i = 0; i < n; i++) {
    if (arr[i] < i) {
      zero_idx = i;
      while (zero_idx < n - 1 && arr[zero_idx + 1] == arr[zero_idx]) zero_idx++;
      break;
    }
  }
  dp[0] = 1;
  for (int i = 1; i <= maxn * 10; i++) {
    dp[i] = dp[i - 1] + c(n - 2 + i, n - 2);
    dp[i] %= mod;
  }
  long long ans = 0;
  for (int i = 0; i <= zero_idx; i++) {
    long long added = 0;
    long long sum = 0, need_cnt = i;
    for (int j = 0; j < i; j = nxtbig[j]) {
      sum += (1ll * (arr[i] - arr[j]) / n + 1) * (min(nxtbig[j], i) - j);
    }
    for (; added * n + arr[i] <= arr[zero_idx];) {
      long long left = arr[i] + added * n - sum - added;
      if (left < 0) break;
      ans += dp[left];
      if (added != 0 && left >= n - (need_cnt + 1)) {
        ans -= dp[left - (n - (need_cnt + 1))];
      }
      ans %= mod;
      added++;
      while (need_cnt + 1 < n && arr[need_cnt + 1] < added * n + arr[i])
        need_cnt = nxtbig[need_cnt + 1] - 1;
      sum += need_cnt;
    }
  }
  cout << (ans + mod) % mod << endl;
  return 0;
}
