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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<int>A(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }
    int mi = 1;
    long long ans = 2*N;
    for(int i = 2; i <= 2*N; i++) {
        int cnt = 0;
        int now = 0;
        while(now < N && (i+1)*cnt <= ans) {
            cnt++;
            int nxt = (A[now]/i+1)*i;
            int it = lower_bound(A.begin(),A.end(),nxt)-A.begin();
            now = it;
        }
        if(ans > (i+1)*cnt) {
            ans = (i+1)*cnt;
            mi = i;
        }
    }
    cout << mi << "\n";
    cout << ans << "\n";
}