#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin>>N;
    vector<int>A(N);
    rep(i,N)cin>>A[i];
    vector<vector<int>>V(N);
    rep(i,N){
        int b=1;
        while(b*b<=A[i]){
            if((A[i]+b)/(b+1)+(A[i]%(b+1)==0)<2*N)V[i].push_back((A[i]+b)/(b+1)+(A[i]%(b+1)==0));
            if(b<2*N)V[i].push_back(b);
            b++;
        }
        if(A[i]+1<2*N)V[i].push_back(A[i]+1);
        sort(all(V[i]));
        V[i].erase(unique(all(V[i])),V[i].end());
    }
    vector<int>S(2*N+1);
    rep(i,N-1){
        vector<int>X;
        for(auto x:V[i])X.push_back(x);
        for(auto x:V[i+1])X.push_back(x);
        X.push_back(2*N);
        sort(all(X));
        X.erase(unique(all(X)),X.end());
        int l=X.size();
        rep(j,l-1){
            int px=X[j],qx=X[j+1];
            if(A[i]/px<A[i+1]/px){
                S[px]++;
                S[qx]--;
            }
        }
    }
    int k=1;
    ll ans=2*N;
    rep(i,2*N)S[i+1]+=S[i];
    for(ll x=2;x<=2*N-1;x++){
        if(chmin(ans,(x+1)*(S[x]+1)))k=x;
    }
    cout<<k<<"\n";
    cout<<ans<<"\n";
}