#include <bits/stdc++.h>
#define rep(i,j,k) for(int i = (j);i <= (k);i++)
#define per(i,j,k) for(int i = (j);i >= (k);i--)
#define mod 998244353
using namespace std;

inline void add(int &x,int y){
	x += y;
	if(x >= mod) x -= mod;
}

inline void sub(int &x,int y){
	x -= y;
	if(x < 0) x += mod;
}

template <class P>
void chkmax(P &x,P y){
	if(x < y) x = y;
}

int T,n;
int a[5005],b[5005];
int f[5005],g[5005],S[5005][5005];

int pos;
int spcalc(){
	fill(b + 1,b + n + 1,0);
	rep(i,1,n) b[a[i]]++;
	per(i,n - 1,1) b[i] += b[i + 1];

	fill(g,g + n + 1,0);
	g[0] = 1;
	int k = 0;
	rep(i,1,n) if(a[i] > n - pos) k++;

	rep(i,1,n - pos){
		rep(j,0,i){
			add(f[j + 1],g[j]);
			add(f[j],1ll * g[j] * (b[i] - k) % mod);
		}
		rep(j,0,i){
			g[j] = f[j];
			f[j] = 0;
		}
	}
	int ans = 0,tmp = 1;
	rep(j,0,n) add(ans,1ll * S[j][k] * g[j] % mod);
	rep(i,1,k) ans = ans * i % mod;
	rep(i,1,n - pos) tmp = tmp * i % mod;
	sub(ans,tmp);
	return ans;
}

void solve(){
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",&a[i]);
	fill(g,g + n + 1,0);
	g[0] = 1;
	pos = 0;
	rep(i,1,n) if(a[i] <= n - i) chkmax(pos,i);
	printf("%d ",n - pos);

	rep(i,pos + 1,n){
		rep(j,0,i){
			add(f[j + 1],g[j]);
			add(f[j],1ll * g[j] * (a[i] - a[pos]) % mod);
		}
		rep(j,0,i){
			g[j] = f[j];
			f[j] = 0;
		}
	}
	int ans = 0;
	rep(j,0,n) add(ans,1ll * S[j][a[pos]] * g[j] % mod);
	rep(j,1,a[pos]) ans = 1ll * ans * j % mod;

	if(a[pos + 1] == n - pos) add(ans,spcalc());
	printf("%d\n",ans);
}

int main(){
	S[0][0] = 1;
	rep(i,1,5000){
		rep(j,1,i) S[i][j] = (S[i - 1][j - 1] + 1ll * j * S[i - 1][j]) % mod;
	}
//	scanf("%d",&T);
	solve();
	return 0;
}
//g++ D.cpp -o D -Wall -Wshadow -O2 -std=c++14 -Wno-unused-result