#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=5050,mod=998244353;
ll n,a[N],t[N],k,ans,jc=1,dp[N][N];
ll solve(){
    memset(dp,0,sizeof dp);dp[0][0]=1;
    for(int i=1;i<=k;i++)
        for(int j=0;j<=a[k+1];j++){
            dp[i][j]=dp[i-1][j]*(a[i]-a[k+1]+j)%mod;
            if(j) (dp[i][j]+=dp[i-1][j-1]*(a[k+1]-j+1))%=mod;
        }
    return dp[k][a[k+1]];
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n;for(int i=n;i;i--) cin>>a[i],t[a[i]]++;
    for(int i=1;i<n;i++) if(a[i+1]<=i){k=i;break;}
    ans=solve();for(int i=2;i<=k;i++) jc=jc*i%mod;
    for(int i=n;i;i--) t[i]+=t[i+1],a[i]=t[i];
    cout<<k<<" "<<((ans+solve()-jc)%mod+mod)%mod;
    return 0;
}