Problem: At Moscow Workshops ICPC team gets a balloon for each problem they solved first. Team MSU Red Panda got so many balloons that they didn't know how to spend them. So they came up with a problem with them.

There are several balloons, not more than 10^6 in total, each one is colored in one of k colors. We can perform the following operation: choose k-1 balloons such that they are of k-1 different colors, and recolor them all into remaining color. We can perform this operation any finite number of times (for example, we can only perform the operation if there are at least k-1 different colors among current balls).

How many different balloon configurations can we get? Only number of balloons of each color matters, configurations differing only by the order of balloons are counted as equal. As this number can be very large, output it modulo 998244353.

Input

The first line contains a single integer k (2 ≤ k ≤ 10^5) —the number of colors.

The second line contains k integers a_1, a_2, …, a_k (0 ≤ a_i) —initial configuration of balloons. a_i is number of balloons of color i. The total number of balloons doesn't exceed 10^6. In other words,

a_1 + a_2 + a_3 + … + a_k ≤ 10^6.

Output

Output number of possible configurations modulo 998244353.

Examples

Input


3
0 1 2


Output


3


Input


4
1 1 1 1


Output


5

Input


5
0 0 1 2 3


Output


1

Input


3
2 2 8


Output


31

Note

In the first example, there are 3 configurations we can get: [0, 1, 2], [2, 0, 1], [1, 2, 0].

In the second example, we can apply the operation not more than once, and possible configurations are: [1, 1, 1, 1], [0, 0, 0, 4], [0, 0, 4, 0], [0, 4, 0, 0], [4, 0, 0, 0]. 

In the third example, we can't apply any operations, so the only achievable configuration is the starting one.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
const int N = 2000000;
int fac[N + 10], inv[N + 10];
int fpow(int a, int b) {
  int ans = 1, t = a;
  while (b) {
    if (b & 1) ans = 1ll * ans * t % Mod;
    t = 1ll * t * t % Mod;
    b >>= 1;
  }
  return ans;
}
void init() {
  fac[0] = 1;
  for (int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % Mod;
  inv[N] = fpow(fac[N], Mod - 2);
  for (int i = N; i >= 1; i--) inv[i - 1] = 1ll * inv[i] * i % Mod;
  return;
}
int C(int n, int m) {
  if (n < 0 || m < 0 || n - m < 0) return 0;
  return 1ll * fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
int F(int n, int m) { return C(n + m - 1, m - 1); }
int sum[N + 10];
int a[100010];
int main() {
  init();
  int n, m;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  m = a[n];
  for (int i = 1; i <= n; i++)
    for (int j = a[i] + 1; j <= m; j += n) sum[j]++;
  for (int j = 1; j <= m; j++) sum[j] += sum[j - 1];
  int ans = 0, now = 0;
  bool flag = true;
  for (int i = 0; i <= m; i++) {
    while (a[now + 1] < i) {
      now++;
      flag &= (a[now] >= now - 1);
    }
    if (!flag) break;
    ans = (ans + F(i - sum[i], n)) % Mod;
    ans = (ans - F(i - sum[i] - (n - now), n) + Mod) % Mod;
  }
  printf("%d\n", ans);
  return 0;
}