#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=(1<<17)+5,M=N*40+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,A[N],B[N];
ll ans,frc[N],inv[N];
ll C(int x,int y){return frc[x]*inv[y]%mod*inv[x-y]%mod;}
void Do(int a1){
	int i,j;
	int Ct=0;for(i=1;i<=n;i++) if(A[i]>a1) Ct++;
	for(i=0;i<=Ct;i++){
		ll tot=C(Ct,i)*(i&1?mod-1:1)%mod;
		ll t1=1,t2=1,t3=1,t4=1,t5=1,t6=1;
		for(j=1;j+5<=a1;j+=6){
			t1=t1*(B[j]-i)%mod;
			t2=t2*(B[j+1]-i)%mod;
			t3=t3*(B[j+2]-i)%mod;
			t4=t4*(B[j+3]-i)%mod;
			t5=t5*(B[j+4]-i)%mod;
			t6=t6*(B[j+5]-i)%mod;
		} 
		tot=tot*t1%mod*t2%mod*t3%mod*t4%mod*t5%mod*t6%mod;
		for(;j<=a1;j++){
			tot=tot*(B[j]-i)%mod;
		}
		ans+=tot;
	}
}
void Solve(){
	int i,j;scanf("%d",&n);
	inv[1]=1;for(i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(inv[0]=frc[0]=i=1;i<=n;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	for(i=n;i;i--) scanf("%d",&A[i]);
	for(i=1;i<=n;i++){
		B[i]=(i^1?B[i-1]:n);
		while(B[i]&&A[B[i]]<i) B[i]--;
	}
	int a1=0;
	for(i=1;i<=n;i++) a1=max(a1,min(i,A[i]));
	if(A[a1]>a1) swap(A,B);
	Do(a1);
	if(A[a1]==a1&&B[a1]==a1){
		swap(A,B);Do(a1);
		ll tot=1;for(i=1;i<=a1;i++) tot=tot*i%mod;ans-=tot;
	}
	printf("%d %lld\n",a1,(ans%mod+mod)%mod);
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}