#include<bits/stdc++.h>
using namespace std;
const int NMAX=5005,MOD=998244353;
int n,r,a[NMAX],b[NMAX],aux[NMAX][NMAX],dp[NMAX][NMAX];
///dp[i][j] = number of ways to cover the first i lines and j columns
int find_r()
{
    int ans=1;
    while(ans<=n && a[ans]>=ans)
        ans++;
    return ans-1;
}
void compute_transpose()
{
    for(int i=1; i<=n; i++)
        for(int j=1; j<=a[i]; j++)
            aux[i][j]=1;
    for(int j=1; j<=n; j++)
        for(int i=1; i<=n; i++)
            b[j]+=aux[i][j];
}
int solve(int *a)
{
    int x=a[r+1];///number of lines/columns we must occupy
    memset(dp,0,sizeof(dp));
    dp[0][0]=1;
    for(int i=0; i<r; i++)
        for(int j=0; j<r; j++)
        {
            if(j<x)///we still have to occupy some lines/columns
                dp[i+1][j+1]=(dp[i+1][j+1]+(1LL*(x-j)*dp[i][j])%MOD)%MOD;
            dp[i+1][j]=(dp[i+1][j]+(1LL*(a[i+1]-(x-j))*dp[i][j])%MOD)%MOD;
        }
    return dp[r][x];
}
int find_w(int r)
{
    int fact=1;

    compute_transpose();
    for(int i=1; i<=r; i++)
        fact=(fact*i)%MOD;

    return ((solve(a)+solve(b))%MOD-fact+MOD)%MOD;///ansLines+ansColumns-factorial
    ///if we don't need to compute an answer for the lines
    ///or for the columns, we will get factorial from those functions
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[n-i+1];
    r=find_r();
    cout<<r<<' '<<find_w(r);
    return 0;
}