#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;



int as[100004];
int main() {
    int n, i, r, x, c, v, nv, m, j, k, ri;
    scanf("%d", &n);
    for (i=0; i<n; i++) scanf("%d", &as[i]);
    r=n*2; ri=1;
    for (k=2; k+1<r; k++) {
        x = r/(k+1);
        c = 0;
        for (i=0; i<n; ) {
            v=as[i];
            m = v/k;
            nv = m*k+k-1;
            j = upper_bound(as, as+n, nv)-as;
            i=j;
            c++;
            if (c>x) break;
        }
        c*=(k+1);
        if (r>c) { r=c; ri=k; }
    }
    printf("%d\n%d\n", ri, r);
    return 0;
}