#pragma GCC optimize("Ofast,inline,unroll-loops")
#include <bits/stdc++.h>
#define mod 998244353
using namespace std;
bool a[5002][5002];
int v1[5002], v2[5002];
int dp[5002][5002];
int n;
int find_r(){
    int r = 0;
    while(a[r + 1][r + 1]) r++;
    return r;
}
void find_v2(){
    for(int j = 1; j <= n; j++){
        int i = 0;
        while(a[i + 1][j]) i++;
        v2[j] = i;
    }
}
int compute(int v[], int r){
    int t = v[r + 1];
    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 < t) dp[i + 1][j + 1] = (1LL * dp[i + 1][j + 1] + 1LL * dp[i][j] * (t - j)) % mod;
            dp[i + 1][j] = (1LL * dp[i + 1][j] + 1LL * dp[i][j] * (v[i + 1] - (t - j))) % mod;
        }
    }
    return dp[r][t];
}
int fact(int x){
    int f = 1;
    for(int i = 1; i <= x; i++) f = (1LL * f * i) % mod;
    return f;
}
int main()
{
    int i,r;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(i = 1; i <= n; i++){
        cin >> v1[n - i + 1];
        for(int j = 1; j <= v1[n - i + 1]; j++) a[n - i + 1][j] = 1;
    }
    r = find_r();
    find_v2();
    cout << r << " " << (((1LL * (compute(v1,r) + compute(v2, r) - fact(r))) % mod) + mod) % mod;
    return 0;
}