#include <bits/stdc++.h>
using namespace std;

#define int long long
const int MAXN = 5e3 + 5;
const int MOD = 998244353;

int n, k;
int a[MAXN], b[MAXN];
int dp[MAXN][MAXN];
int fact[MAXN];

signed main() {
	cin.tie(0)->sync_with_stdio(false);
	
	fact[0] = 1;
	for(int i = 1; i < MAXN; ++i) {
	    fact[i] = fact[i - 1] * i; fact[i] %= MOD;
	}

	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	reverse(a + 1, a + 1 + n);

	int idx = 0, val = n;
	for(int i = n; i >= 2; --i) {
		if(a[i - 1] > a[i]) {
			for(int j = idx + 1; j <= a[i]; ++j) b[j] = val;
			idx = a[i]; val = i - 1;
		}
	}
	for(int i = idx + 1; i <= a[1]; ++i) b[i] = val;
	
	for(int i = 1; i <= n; ++i) {
	    if(i <= a[i]) k = i;
	    else break;
	}
	
	dp[0][0] = 1;
	for(int i = 0; i < k; ++i) {
	    for(int j = 0; j <= a[k + 1]; ++j) {
	        dp[i + 1][j] += ((a[i + 1] - (a[k + 1] - j)) % MOD * dp[i][j]) % MOD; dp[i + 1][j] %= MOD;
	        dp[i + 1][j + 1] += ((a[k + 1] - j) * dp[i][j]) % MOD; dp[i + 1][j + 1] %= MOD;
	    }
	}
	
	int ans = dp[k][a[k + 1]] % MOD;
	
	memset(dp, 0, sizeof(dp));
	dp[0][0] = 1; swap(a, b);
	for(int i = 0; i < k; ++i) {
	    for(int j = 0; j <= a[k + 1]; ++j) {
	        dp[i + 1][j] += ((a[i + 1] - (a[k + 1] - j)) % MOD * dp[i][j]) % MOD; dp[i + 1][j] %= MOD;
	        dp[i + 1][j + 1] += ((a[k + 1] - j) * dp[i][j]) % MOD; dp[i + 1][j + 1] %= MOD;
	    }
	}
	
	ans += dp[k][a[k + 1]] % MOD; ans %= MOD;
	ans -= fact[k]; ans %= MOD;
	cout << k << " " << ans << endl;
}