#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod = 998244353;
// Cope Counter = at least 120

ll po(ll b, ll p) {
  ll a = 1;
  while(p > 0) {
    if(p % 2 == 1) a = a * b % mod;
    b = b * b % mod;
    p /= 2;
  }
  return a;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
  ll n;
  cin >> n;
  ll fact[n + 1], inv[n + 1], arr[n + 1][2];
  fact[0] = 1;
  for(ll i = 1; i <= n; i++) fact[i] = fact[i - 1] * i % mod;
  inv[n] = po(fact[n], mod - 2);
  for(ll i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
  ll smax = 0, c = 0;
  arr[n][0] = arr[n][1] = 0;
  for(ll i = n - 1; i >= 0; i--) {
    cin >> arr[i][0];
    for(; c < arr[i][0]; c++) arr[c][1] = i + 1;
    smax = max(smax, min(i + 1, arr[i][0]));
  }
  for(; c <= n; c++) arr[c][1] = 0;
  ll ans = 0, cur, cols;
  for(int bk = 0; bk < 2; bk++) {
    cols = arr[smax][bk];
    for(ll i = 0; i <= cols; i++) {
      cur = fact[cols] * inv[i] % mod * inv[cols - i] % mod;
      for(ll j = 0; j < smax; j++) {
        cur = cur * (arr[j][bk] - i) % mod;
      }
      if(i & 1) cur = -cur;
      ans = (ans + cur + mod) % mod;
    }
  }
  cout << smax << " " << (ans - fact[smax]) % mod << "\n";
}