#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,p,lim;
int a[N];
void s(int l,int r){
	if (l>r) return;
	int mid=(l+r)/2;
	if (a[mid]<lim) p=mid,s(mid+1,r); else s(l,mid-1);
}
int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	int ans=2*n,q=1;
	for (int i=2;i<2*n;i++){
		int pos=1,t=0;
		while (pos<=n&&t*(i+1)<ans){
			lim=(a[pos]/i+1)*i;
			p=0; s(1,n);
			t++; pos=p+1;
		}
		if (pos>n&&ans>t*(i+1)) ans=min(ans,t*(i+1)),q=i;
	}
	printf("%d\n",q);
	printf("%d\n",ans);
}