#include<iostream>
#include<vector>
#include<algorithm>
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];
    int ax=-1;
    ll ac=1LL<<60;
    for(int x=1;x<=2*n-1;x++){
        int d=0,at=0;
        bool flag=true;
        while(at<n){
            int ok=at,ng=n;
            while(ng-ok>1){
                int mid=(ok+ng)/2;
                if(a[at]/x==a[mid]/x)ok=mid;
                else ng=mid;
            }
            d++;
            at=ok+1;
            if((ll)(x+1)*d>2*n){
                flag=false;
                break;
            }
        }
        if(flag&&chmin(ac,(ll)(x+1)*d))ax=x;
    }
    cout<<ax<<"\n"<<ac<<"\n";
}