#include <bits/stdc++.h>
#define Mod 998244353
#define int long long

using namespace std;

int k;
int din(vector <int> a){
    int n = a.size();
    int x = 0;
    int it = n - 1;
    if(n == k) x = 0;
    else x = a[k];

    int dp[n + 1][n + 1];
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++) dp[i][j] = 0;
    }

    dp[0][ x ] = 1;

    for(int i = 0; i < k; i++){
        for(int j = 0; j <= x; j++){
            // acoperim o cloana neimportanta
            dp[i + 1][j] += (a[i] - j) * dp[i][j];
            dp[i + 1][j] %= Mod;
            // acoperim o coloana importanta
            if(j > 0){
                dp[i + 1][j - 1] += j * dp[i][j];
                dp[i + 1][j - 1] %= Mod;
            }
        }
    }


    return dp[k][0];
}

signed  main(){
    cin.tie(0);ios::sync_with_stdio(0);

    int n; cin >> n;
    vector <int> v(n);
    for(int i = 0; i < n; i++) cin >> v[i];
    reverse(v.begin(), v.end());
    k = n;

    for(int i = 0; i < n; i++){
        if(v[i] < i + 1){
            k = i;
            break;
        }
    }

    cout << k << " ";


    int val1 = din(v);
    //cout << "val1 = "  << val1 << endl;

    vector<int> v1(n);
    for(int i = 0; i < n; i++) v1[i] = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < v[i]; j++){
            v1[j]++;
        }
    }
    //reverse(v1.begin(), v1.end());

    int val2 = din(v1);
    //cout << "val2 = " << val2 << endl;

    int fact = 1;
    for(int i = 2; i <= k; i++){
        fact *= i;
        fact %= Mod;
    }
    //cout << "fact = " << fact << endl;

    cout << val1 + val2 - fact << endl;



    return 0;
}