#include <iostream>

using namespace std;

const int MOD = 998244353;
const int N = 5500;

long long dp[N][N];
int a[N], a1[N], a2[N];

int solve ( int a[], int k ) {
    
    for ( int i = 0; i < N; i++ )
        for ( int j = 0; j < N; j++ )
            dp[i][j] = 0;
    
    dp[0][a[k + 1]] = 1;
    
    for ( int i = 0; i < k; i++ ) {
        for ( int j = 0; j < k + 1; j++ ) {
            if ( j > 0 )
                dp[i + 1][j - 1] += ( dp[i][j] * j ) % MOD;
            dp[i + 1][j] += ( (a[i + 1] - j) * dp[i][j] ) % MOD;
        }
    }
    
    return 0;
}

int main () {
    
    int n;
    long long ans = 0;
    
    cin >> n;
    
    for ( int i = 1; i <= n; i++ )
        cin >> a[n + 1 - i];
    
    int k = 1;
    while ( a[k] >= k )
        k++;
    k--;
    
    cout << k << " ";
    
    if ( a[k] != 0 ) {
        solve ( a, k );
        ans = dp[k][0] % MOD;
    }
    
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = 1; j <= a[i]; j++ )
            a1[j]++;
    }
    
    if ( a1[k] != 0 ) {
        solve ( a1, k );
        ans = ( ans + dp[k][0] ) % MOD;
    }
    
    long long fact = 1;
    for ( int i = 1; i <= k; i++ )
        fact = ( fact * i ) % MOD;
    
    cout << ( ans - fact ) % MOD << "\n";
    
    return 0;
}