#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i=0;i<(long long)(n);i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
const ll INF=(1ll<<60);
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
ll n;
vector<ll> a;
ll f(ll x){
    set<ll> st;
    rep(i,n) st.insert(a[i]/x);
    return (x+1)*st.size();
}
int main(){
    cin >> n;
    a.resize(n);
    vector<ll> v;
    rep(i,n){
        cin >> a[i];
        for(ll j=1;j*j<=a[i];j++){
            if(a[i]%j==0){
                v.push_back(j);
                v.push_back(a[i]/j);
            }
        }
    }
    pll ans={INF,f(a.back()+1)};
    mt19937 mt;
    rep(i,1000){
        ll x=mt()%v.size();
        chmin(ans,{f(v[x]),v[x]});
    }
    cout << ans.second << endl;
    cout << ans.first << endl;
}