#include<bits/stdc++.h>
using namespace std;
int n,a[5050],r,dp[5050][5050],res,fac[5050],ifac[5050],g[5050][5050];
const int mo=998244353;

int ksm(int x,int y){
	int res=1;
	while (y){
		if (y&1) res=1ll*res*x%mo;
		x=1ll*x*x%mo;
		y/=2;
	}
	return res;
}

int c(int x,int y){//x>=y
	if (x<y) return 0;
	return 1ll*fac[x]*ifac[y]%mo*ifac[x-y]%mo;
}

int main(){
	//freopen("D.in","r",stdin);
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for (int i=n;i;i--){
		if (r>=a[i]) break;
		r++;
	}
	
	dp[n][a[n-r]]=1;
	for (int i=n;i>n-r;i--)
		for (int j=0;j<=a[n-r];j++){
			//printf("%d %d %d\n",i,j,dp[0][i][j]);
			dp[i-1][j]=(dp[i-1][j]+1ll*dp[i][j]*(a[i]-j))%mo;
			if (j)
				dp[i-1][j-1]=(dp[i-1][j-1]+1ll*dp[i][j]*j)%mo;
	}
	res=dp[n-r][0];
	memset(dp,0,sizeof(dp));
	//printf("%d\n",res);
	
	dp[n][a[n-r+1]]=1;
	for (int i=n;i>n-r;i--)
		for (int j=0;j<=a[n-r+1];j++){
			//printf("%d %d %d\n",i,j,dp[0][i][j]);
			dp[i-1][j]=(dp[i-1][j]+1ll*dp[i][j]*(a[i]-j))%mo;
			if (j)
				dp[i-1][j-1]=(dp[i-1][j-1]+1ll*dp[i][j]*j)%mo;
	}
	res=(res-dp[n-r][0]+mo)%mo;
	memset(dp,0,sizeof(dp));
	//printf("%d\n",res);
	
	fac[0]=1;
	for (int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mo;
	ifac[n]=ksm(fac[n],mo-2);
	for (int i=n;i;i--) ifac[i-1]=1ll*ifac[i]*i%mo;
	g[1][0]=1;
	for (int i=1;i<=n;i++){
		//0
		//for (int j=0;j<=r;j++) 
			//printf("%d %d %d\n",i,j,g[i][j]);
		if (a[i]<=r){
			for (int j=0;j<=r;j++) g[i+1][j]=(g[i+1][j]+g[i][j])%mo;
		}
		//1
		for (int j=0;j<r;j++){
			if (g[i][j]==0) continue;
			for (int k=j+1;k<=r&&k<=a[i];k++){
				g[i+1][k]=(g[i+1][k]+1ll*g[i][j]*c(min(a[i],r)-j,k-j))%mo;
			}
		}
	}
	//printf("%d\n",g[n+1][r]);
	res=(res+g[n+1][r])%mo;
	printf("%d %d\n",r,res);
}