#include<bits/stdc++.h>
using namespace std;
long long n,ct=1,mx,k;
long long a[1000005],p[1000005];
map<int,long long> m;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=2;i<=n;i++){
		if(a[i-1]>a[i])p[i]=p[i-1]-1;
		else if(a[i-1]<a[i])p[i]=p[i-1]+1;
	}
	for(int i=2;i<=n;i++){
		if(p[i]==0){
			if(a[i]==a[1])ct++;
			continue;
		}
		if(abs(a[i]-a[1])%abs(p[i]))continue;
		if((a[i]-a[1])*p[i]<0)continue;
		m[(a[i]-a[1])/p[i]]++;
		if(m[(a[i]-a[1])/p[i]]>mx){
			mx=m[(a[i]-a[1])/p[i]];
			k=(a[i]-a[1])/p[i];
		}
		mx=max(mx,m[(a[i]-a[1])/p[i]]);
	}
	cout<<mx+ct<<endl<<k;
	return 0;
}

进不去luogu，耶~~👀️ 👀️ 👀️