#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ll N,an=1e9,x;
    cin>>N;
    vector<ll> A(N);
    for(ll &a:A)cin>>a;
    for(ll i=1;i<=2*N;i++){
        ll res=0,L=0;
        while(1){
            auto p=lower_bound(A.begin(),A.end(),L*i);
            if(p==A.end())break;
            res++;
            L=(*p/i)+1;
            if(res*(i+1)>=an)break;
        }
        if(an>res*(i+1))an=res*(i+1),x=i;
    }
    cout<<x<<endl<<an<<endl;
}