#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using vl = vector <ll>;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1e5 + 11;
int a[N];

int check(int n, int x, int lim) {
	int p = 0;
	int re = 0;
	while(p < n) {
		re ++;
		if(re > lim) return -1;
		
		int l = a[p] / x * x;
		int r = l + x;
		p = lower_bound(a, a + n, r) - a;
	}
	return re;
}

int main() {
	ios::sync_with_stdio(0);
	int n; cin >> n;
	for(int i = 0; i < n; i ++)
		cin >> a[i];
	
	int ans = 2 * n, p = 1; 
	for(int i = 2; i <= 2 * n; i ++) {
		int x = check(n, i, 2 * n / i);
		if(x != -1) {
			int y = (i + 1) * x;
			if(y < ans) {
				ans = y;
				p = i;
			}
		}
	}
	
	cout << p << '\n' << ans << '\n';
}