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

const int N = 140000 * 4;
const int p = 998244353;
typedef std::vector <int> Poly;

char buf[1 << 25] ,*p1 = buf ,*p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf ,1 ,1 << 21 ,stdin) ,p1 == p2) ? EOF : *p1++)
inline int read() {
    int x = 0, f = 1; char ch = getchar();
    while(ch > '9' || ch < '0') { if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
    return x * f;
}

inline int pls(int a,int b) { return a + b >= p ? a + b - p : a + b; }
inline int mus(int a,int b) { return a - b < 0 ? a - b + p : a - b; }
inline int prd(int a,int b) { return 1ll * a * b % p; }
inline int fastpow(int a,int b) {
    int r = 1;
    while(b) {
        if(b & 1) r = 1ll * r * a % p;
        a = 1ll * a * a % p;
        b >>= 1;
    }
    return r;
}

int rev[N];
void NTT(Poly &a) {
    int N = a.size();
    for(int i = 0;i < N;i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) * N / 2);
    for(int i = 0;i < N;i++) if(i > rev[i]) std::swap(a[i],a[rev[i]]);
    for(int n = 2, m = 1;n <= N;m = n, n <<= 1) {
        int g1 = fastpow(3,(p - 1) / n), t1, t2;
        for(int l = 0;l < N;l += n) {
            int g = 1;
            for(int i = l;i < l + m;i++) {
                t1 = a[i], t2 = prd(a[i + m],g);
                a[i] = pls(t1,t2), a[i + m] = mus(t1,t2);
                g = prd(g,g1);
            }
        }
    }
    return;
}

void INTT(Poly &a) {
    NTT(a), std::reverse(a.begin() + 1,a.end()); 
    int invN = fastpow(a.size(),p - 2);
    for(int i = 0;i < (int)a.size();i++) a[i] = prd(a[i],invN);
}

Poly Mul(Poly a,Poly b) {
    int n = a.size() + b.size() - 1, N = 1;
    while(N < (int)(a.size() + b.size())) N <<= 1;
    a.resize(N), b.resize(N), NTT(a), NTT(b);
    for(int i = 0;i < N;i++) a[i] = prd(a[i],b[i]);
    INTT(a), a.resize(n);
    return a;
}

Poly MulT(Poly a,Poly b) {
    int n = a.size(), m = b.size(); 
    std::reverse(b.begin(),b.end()), b = Mul(a,b);
    for(int i = 0;i < n;i++) a[i] = b[i + m - 1];
    return a;
}

Poly tmp;
Poly Inv(Poly a,int n) {
    if(n == 1) return Poly(1,fastpow(a[0],p - 2));
    Poly b = Inv(a,(n + 1) / 2);
    int N = 1; while(N <= 2 * n) N <<= 1;
    tmp.resize(N), b.resize(N);
    for(int i = 0;i < n;i++) tmp[i] = a[i];
    for(int i = n;i < N;i++) tmp[i] = 0;
    NTT(tmp), NTT(b);
    for(int i = 0;i < N;i++) b[i] = mus(prd(2,b[i]),prd(prd(b[i],b[i]),tmp[i]));
    INTT(b), b.resize(n); return b;
}


#define lc(k) k << 1
#define rc(k) k << 1 | 1
const int NODE = N * 4;
Poly Q[NODE];

void Init(Poly &a,int k,int l,int r) {
    if(l == r) {
        Q[k].resize(2);
        Q[k][0] = 1, Q[k][1] = mus(0,a[l]);
        return;
    }
    int m = (l + r) / 2;
    Init(a,lc(k),l,m), Init(a,rc(k),m + 1,r);
    Q[k] = Mul(Q[lc(k)],Q[rc(k)]);
    return;
}

void Multipoints(int k,int l,int r,Poly F,Poly &g) {
    F.resize(r - l + 1);
    if(l == r) return void(g[l] = F[0]);
    int m = (l + r) / 2;
    Multipoints(lc(k),l,m,MulT(F,Q[rc(k)]),g);
    Multipoints(rc(k),m + 1,r,MulT(F,Q[lc(k)]),g);
    return;
}

void Multipoint(Poly f,Poly a,Poly &v,int n) {
    f.resize(n + 1), a.resize(n);
    Init(a,1,0,n - 1), v.resize(n);
    Multipoints(1,0,n - 1,MulT(f,Inv(Q[1],n + 1)),v);
    return;
}


int gao(int a[],int n){
	int k=0;
	for (int i=1;i<=n;i++) if (i<=a[i]) k=i;
	int t=a[k+1];
	
	function<Poly(int,int)> solve=[&](int l,int r){
		if (l==r){
			return (Poly){a[l],p-1};
		}
		int mid=(l+r)>>1;
		return Mul(solve(l,mid),solve(mid+1,r));
	};
	
	Poly f=solve(1,k);
	/*
	for (auto coef:f) cerr << coef << " ";
	cout << "\n";
	*/
	Poly _a,v;
	for (int i=0;i<=t;i++) _a.emplace_back(i);
	Multipoint(f,_a,v,std::max(k,t+1));
	
	int ans=0;
	int flag=1;
	int comb=1;
	for (int i=0;i<=t;i++){
		ans=(ans+1LL*flag*comb%p*v[i]%p)%p;
		comb=1LL*comb*(t-i)%p*fastpow(i+1,p-2)%p;
		flag=p-flag;
	}
	return ans;
}

int n;
int a[140050];
int b[140050];

signed main(){
	/*
    n = read() + 1, m = read();
    for(int i = 0;i < n;i++) f.push_back(read());
    for(int i = 0;i < m;i++) a.push_back(read());
    Multipoint(f,a,v,std::max(n,m));
    for(int i = 0;i < m;i++) std::printf("%d\n",v[i]);
    */
    cin >> n;
    for (int i=1;i<=n;i++) cin >> a[i];
    reverse(a+1,a+n+1);
    
    int ans=0;
    ans=(ans+gao(a,n))%p;
    for (int i=1;i<=n;i++) b[a[i]]++;
    for (int i=n;i>=1;i--) b[i]+=b[i+1];
	ans=(ans+gao(b,n))%p;
	{
		int D=0;
		for (int i=1;i<=n;i++) if (i<=a[i]) D=i;
		int prod=1;
		for (int i=1;i<=D;i++) prod=1LL*prod*i%p;
		ans=(ans+p-prod)%p;	
		cout << D << " " << ans << "\n";
	}
    return 0;
}