#include <bits/stdc++.h>
using lint = long long;
const int N = 5e3 + 10;
const int MOD = 998244353;

lint cnt, f[N][N];
int n, k, a[N], b[N];

void input() {
	std::cin >> n;
	for (int i = 1; i <= n; ++i)
		std::cin >> a[i];
	std::reverse(a + 1, a + n + 1);
}

int get_ans() {
	int p = 0;
	while (p + 1 <= n && p + 1 <= a[p + 1]) ++p;
	return p;
}

int dp(int m) { // m：剩余的关键列
	memset(f, 0, sizeof(f));
	f[0][0] = 1;
	for (int i = 0; i < k; ++i) {
		for (int j = 0; j <= m; ++j) {
			(f[i + 1][j + 1] += f[i][j] * (m - j) % MOD) %= MOD;
			(f[i + 1][j] += f[i][j] * (a[i + 1] - m + j) % MOD) %= MOD;
		}
	}
	return f[k][m];
}

void T() { // 矩阵转置
	for (int i = 1; i <= n; ++i) ++b[a[i]];
	for (int i = n - 1; i; --i) b[i] += b[i + 1];
	memcpy(a, b, sizeof(b));
}

int fact() {
	lint res = 1;
	for (int i = 2; i <= k; ++i) (res *= i) %= MOD;
	return res;
}

int main() {
	input();
	k = get_ans();
	(cnt += dp(a[k + 1])) %= MOD;
	T();
	(cnt += dp(a[k + 1])) %= MOD;
	std::cout << k << " " << (cnt - fact()) << std::endl;
	return 0;
}