#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;

int n, a[N];

int getNext(int x, int p) {
    int l = p, r = n + 1;
    while(l + 1 < r) {
        int mid = (l + r) / 2;
        if(a[mid] / x > a[p] / x) r = mid;
        else l = mid;
    }
    return r;
}

int main() {
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    
    int x = 1, fx = 2 * n;
    for(int i = 2; i < 2 * n; i ++) {
        int cnt = 0;
        for(int j = 1; j <= n; ) {
            j = getNext(i, j);
            cnt ++;
            if(cnt * (i + 1) >= fx) break;
        }
        if(cnt * (i + 1) < fx) {
            x = i;
            fx = cnt * (i + 1);
        }
    }
    cout << x << "\n" << fx;
}