#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n,a[5005],b[5005],fac[5005],sw[5005][5005];
ll f[5005][5005], g[5005][5005], C[5005][5005];
int main(){
	C[0][0]=1;
	for(ll i=1;i<=5000;i++){
		C[i][0]=1;
		sw[i][0]=1;
		for(ll j=1;j<=5000;j++) sw[i][j]=sw[i][j-1]*i%mod;
		for(ll j=1;j<=i;j++){
			C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
		}
	}
	scanf("%lld",&n);
	ll r=0;
	fac[0]=1;
	for(ll i=1;i<=n;i++) fac[i]=fac[i-1]*i%mod;
	for(ll i=n;i>=1;i--){
		scanf("%lld",&a[i]);
		r=max(r, min(i,a[i]));
		for(ll j=1;j<=a[i];j++) b[j]++;
	}
	ll l1=0, l2=0;
	for(ll i=r;i>=1;i--){
		if(a[i]==r) l1++;
		else break;
	}
	for(ll i=r;i>=1;i--){
		if(b[i]==r) l2++;
		else break;
	}
	ll ans=0;
	f[0][0]=1;
	for(ll i=1;i<=r;i++){
		for(ll j=0;j<=i;j++){
			f[i][j]=f[i-1][j];
			if(j) f[i][j]=(f[i][j]+f[i-1][j-1]*(a[i]-r))%mod;
		}
	}
	g[0][0]=1;
	for(ll i=1;i<=r;i++){
		for(ll j=0;j<=i;j++){
			g[i][j]=g[i-1][j];
			if(j) g[i][j]=(g[i][j]+g[i-1][j-1]*(b[i]-r))%mod;
		}
	}
	
	for(ll i=0;i<=l2;i++){
		ll res=0;
		for(ll j=0,xs=1;j<=r-l2;j++,xs=mod-xs){
			res=(res+xs*C[r-l2][j]%mod*sw[r-j][r-i])%mod;
		}
		ans=(ans+res*f[r][i])%mod;
	}
	for(ll i=0;i<=l1;i++){
		ll res=0;
		for(ll j=0,xs=1;j<=r-l1;j++,xs=mod-xs){
			res=(res+xs*C[r-l1][j]%mod*sw[r-j][r-i])%mod;
		}
		ans=(ans+res*g[r][i])%mod;
	}
	ans=(ans+mod-fac[r])%mod;
	printf("%lld %lld\n", r, ans);
}