#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int N=5010,MOD=998244353;

int dp[N][N];

int solve(const int*v,int n,int k)
{
    dp[0][k]=1;
    for(int i=1;i<=n;i++)
        for(int j=0;j<=k;j++)
        {
            dp[i][j]=dp[i-1][j]*(v[i]-j)%MOD;
            if(j)
                (dp[i][j-1]+=dp[i-1][j]*j)%=MOD;
        }
//    for(int i=0;i<=n;i++,cout<<"\n")
//        for(int j=0;j<=k;j++)
//            cout<<dp[i][j]<<" ";
//    cout<<"solve [ ";
//    for(int i=1;i<=n;i++)
//        cout<<v[i]<<" ";
//    cout<<"] "<<k<<" -> "<<dp[n][0]<<"\n";
    return dp[n][0];
}

int pw(int x,int y)
{
    int res=1;
    while(y--)
        res=res*x%MOD;
    return res;
}

int fact(int n)
{
    int res=1;
    for(int i=2;i<=n;i++)
        res=res*i%MOD;
    return res;
}

int a[N],b[N];

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++) {
        cin >> a[i];
        for(int j=1;j<=a[i];j++)
            b[j]++;
    }
    reverse(a+1,a+n+1);
    int cnt=0;
    for(int i=1;i<=n;i++)
        if(a[i]>=i)
            cnt++;
        else
            break;
    int A=solve(a,cnt,a[cnt+1]);
    int B=solve(b,cnt,b[cnt+1]);
//    int PW=pw(cnt,cnt);
    int FACT=fact(cnt);
    cout<<cnt<<" ";
//    cout<<A<<"+"<<B<<"-2*"<<PW<<"+"<<FACT<<"=";
    cout<<(A+B-FACT+MOD)%MOD;
}