#include <bits/stdc++.h>
#define EB emplace_back
#define lg2 std::__lg

typedef long long ll;
const int N = 530054, mod = 998244353, half_mod = (mod + 1) / 2, root = 31;
typedef int vec[N], *pvec;
typedef std::vector <int> vector;

vec fact, inv, finv;

inline int & reduce(int &x) {return x += x >> 31 & mod;}
inline void add(int &x, const int y) {x += y - mod, x += x >> 31 & mod;}
ll PowerMod(ll a, int n, ll c = 1) {for (; n; n >>= 1, a = a * a % mod) if (n & 1) c = c * a % mod; return c;}

void init() {
	int i;
	for (inv[1] = 1, i = 2; i < N; ++i) inv[i] = (ll)(mod - mod / i) * inv[mod % i] % mod;
	for (*finv = *fact = i = 1; i < N; ++i) fact[i] = (ll)fact[i - 1] * i % mod, finv[i] = (ll)finv[i - 1] * inv[i] % mod;
}

namespace Poly {
	int l, n;
	vec rev, x, y;

	void NTT_init(int len) {
		if (l == len) return; n = 1 << (l = len);
		ll g = PowerMod(root, 1 << (23 - l));
		*x = 1, *rev = 0;
		for (int i = 1; i < n; ++i)
			x[i] = x[i - 1] * g % mod, rev[i] = rev[i >> 1] >> 1 | (i & 1) << (l - 1);
	}

	void DNTT(int *d, int *t) {
		int i, *j, *k, len = 1, delta = n, R;
		for (i = 0; i < n; ++i) t[rev[i]] = d[i];
		for (i = 0; i < l; ++i) {
			delta >>= 1;
			for (k = x, j = y; j < y + len; k += delta, ++j) *j = *k;
			for (j = t; j < t + n; j += len << 1)
				for (k = j; k < j + len; ++k)
					R = (ll)y[k - j] * k[len] % mod,
					k[len] = (*k - R < 0 ? *k - R + mod : *k - R),
					*k = (*k + R >= mod ? *k + R - mod : *k + R);
			len <<= 1;
		}
	}

	vec B1, B2, B3, B4, B5, B6, B7;

	void Mul(int deg, pvec a, pvec b, pvec c) {
		if (!deg) {*c = (ll)*a * *b % mod; return;}
		NTT_init(lg2(deg) + 1);
		int i; ll iv = mod - (mod - 1) / n;
		DNTT(a, c), DNTT(b, B1);
		for (i = 0; i < n; ++i) B1[i] = (ll)B1[i] * c[i] % mod;
		DNTT(B1, c), std::reverse(c + 1, c + n);
		for (i = 0; i < n; ++i) c[i] = c[i] * iv % mod;
	}

	void Inv(int deg, pvec a, pvec b) {
		int len, i; ll iv = half_mod;
		*b = PowerMod(*a, mod - 2), b[1] = 0, *B1 = *a, B1[1] = a[1];
		for (len = 0; 1 << len < deg; ++len) {
			NTT_init(len + 2);
			memset(b + (n >> 1), 0, n << 1), DNTT(b, B2);
			memset(B1 + (n >> 1), 0, n << 1), DNTT(B1, B3);
			for (i = 0; i < n; ++i) reduce(B2[i] = B2[i] * (2ll - (ll)B2[i] * B3[i] % mod) % mod);
			DNTT(B2, B3), std::reverse(B3 + 1, B3 + n), iv = (iv >> 1) + half_mod;
			for (i = 0; i < n >> 1; ++i) b[i] = B3[i] * iv % mod;
			memcpy(B1 + i, a + i, n << 1);
		}
	}

	void Diff(int deg, pvec a, pvec b) {for (int i = 1; i <= deg; ++i) b[i - 1] = (ll)a[i] * i % mod;}

	void Intg(int deg, pvec a, pvec b, int ct = 0) {for (int i = 1; i <= deg; ++i) b[i] = (ll)a[i - 1] * inv[i] % mod; *b = ct;}

	void Ln(int deg, pvec a, pvec b) {
		if (!--deg) {*b = 0; return;}
		int i, j = deg * 2 - 1; NTT_init(lg2(j) + 1);
		Diff(deg, a, B4), Inv(deg, a, B5);
		for (i = deg; i < n; ++i) B4[i] = B5[i] = 0;
		Mul(j, B4, B5, B6), Intg(deg, B6, b);
	}

	void Exp(int deg, pvec a, pvec b) {
		int len, i, n = 2;
		*b = 1, b[1] = 0;
		for (len = 0; 1 << len < deg; ++len, n <<= 1) {
			Ln(n, b, B7), *B7 = 1;
			for (i = 1; i < n; ++i) reduce(B7[i] = a[i] - B7[i]);
			memset(B7 + n, 0, n << 2), memset(b + n, 0, n << 2);
			Mul((n << 1) - 1, b, B7, B6), memcpy(b, B6, n << 2);
		}
	}

	void Mul(vector &a, vector &b, vector &ret) {
		int degA = a.size() - 1, degB = b.size() - 1;
		if (!(degA || degB)) {ret.emplace_back((ll)a[0] * b[0] % mod); return;}
		NTT_init(lg2(degA + degB) + 1);
		int i; ll iv = mod - (mod - 1) / n;
		memcpy(B1, a.data(), (degA + 1) << 2), memset(B1 + (degA + 1), 0, (n - degA - 1) << 2);
		memcpy(B2, b.data(), (degB + 1) << 2), memset(B2 + (degB + 1), 0, (n - degB - 1) << 2);
		DNTT(B1, B3), DNTT(B2, B1);
		for (i = 0; i < n; ++i) B1[i] = (ll)B1[i] * B3[i] % mod;
		DNTT(B1, B3), std::reverse(B3 + 1, B3 + n); ret.clear(), ret.reserve(degA + degB + 1);
		for (i = 0; i <= degA + degB; ++i) ret.EB(B3[i] * iv % mod);
	}
}

int n, cnt = 0;
vec fy, Fy;
vector g[N];

int solve(int L, int R) {
	if (L + 1 == R) return L;
	int M = (L + R) / 2, id = cnt++, lp = solve(L, M), rp = solve(M, R);
	return Poly::Mul(g[lp], g[rp], g[id]), id;
}

int main() {
	int i, x, ans = mod - 1; init();
	scanf("%d", &n);
	for (i = 1; i <= n; ++i) fy[i] = mod - finv[i];
	Poly::Exp(n + 1, fy, Fy);
	for (i = 0; i < n; ++i) scanf("%d", &x), add(x, i + 1), g[i].EB(x), g[i].EB(-1);
	cnt = n, x = solve(0, n);
	for (i = 0; i <= n; ++i) ans = (ans + (ll)Fy[i] * fact[i] % mod * g[x][i]) % mod;
	printf("%d\n", ans);
	return 0;
}