#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar())f^=ch=='-';
    for(;isdigit(ch);ch=getchar())x=x*10+(ch^48);
    return f?x:-x;
}
const int N=5005,mo=998244353;
inline void red(int &x){x>=mo?x-=mo:0;}
int ans,a[N],n,f[N][N],k,mp[N][N];
void transform(){
    for(int i=1;i<=n;++i)for(int j=i;j<=n;++j)
        swap(mp[i][j],mp[j][i]);
}
void DP(){
    memset(f,0,sizeof(f));
    int tmp=0;
    for(int i=1;i<=n;++i)
        if(mp[k+1][i])tmp=i;
    f[k+1][tmp]=1;
    for(int i=k;i>=1;--i){
        int cap=0;
        for(int j=1;j<=n;++j)
            if(mp[i][j])cap=j;
        for(int j=0;j<=tmp;++j){
            red(f[i][j]+=f[i+1][j+1]*(j+1)%mo);
            red(f[i][j]+=f[i+1][j]*(cap-j)%mo);
        }
    }
    red(ans+=f[1][0]);
}
signed main(){
    n=read();
    for(int i=1;i<=n;++i)a[i]=read();
    reverse(a+1,a+n+1);
    for(int i=1;i<=n;++i)for(int j=1;j<=a[i];++j)
        mp[i][j]=1;
    int x=1,y=1;
    while(mp[x][y]){
        ++k;
        ++x;
        ++y;
    }
    ans=-1;
    for(int i=1;i<=k;++i)ans=ans*i%mo;
    DP(),transform(),DP();
    printf("%lld %lld\n",k,ans);
    return 0;
}