#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lll __int128
#define pc __builtin_popcount
#define pr pair<int,int>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll rint(ll l,ll r){return uniform_int_distribution<ll>(l,r)(rnd);}
const int maxn=501,p=998244353;
int n,r,m,a[maxn],b[maxn],f[maxn][maxn],v[5],jcr=1,loc;
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	scanf("%d",&n),loc=n;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	while(r<n&&a[n-r]>r) (jcr*=(++r))%=p;
	f[n-r][0]=1;
	for(int i=1;i<=a[n-r];i++) f[n-r][i]=0;
	for(int i=n-r+1;i<=n;i++)
		for(int j=0;j<=a[n-r];j++)
			f[i][j]=(1ll*(j+a[i]-a[n-r])*f[i-1][j]+(j?(a[n-r]-j+1ll)*f[i-1][j-1]:0))%p;
	v[1]=f[n][a[n-r]],m=a[n];
	for(int i=m;i>=1;i--)
	{
		if(loc>1&&a[loc-1]>=i) loc--;
		b[m-i+1]=n-loc+1;
	}
//	for(int i=1;i<=m;i++) cerr<<b[i]<<",";
	f[m-r][0]=1;
	for(int i=1;i<=b[m-r];i++) f[m-r][i]=0;
	for(int i=m-r+1;i<=m;i++)
		for(int j=0;j<=b[m-r];j++)
			f[i][j]=(1ll*(j+b[i]-b[m-r])*f[i-1][j]+(j?(b[m-r]-j+1ll)*f[i-1][j-1]:0))%p;
	v[2]=f[m][b[m-r]];
//	cerr<<v[1]<<" "<<v[2]<<" "<<jcr<<endl;
	printf("%d %d\n",r,((v[1]+v[2]-jcr)%p+p)%p);
	return 0;
}