#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);
    rep(i,n) cin >> a[i];
    pll ans={INF,f(a.back()+1)};
    rep(i,1000){
        chmin(ans,{f(i+1),i+1});
    }
    rep(i,min(n,1000ll)){
        if(a[i]==0) continue;
        chmin(ans,{f(a[i]),a[i]});
    }
    cout << ans.second << endl;
    cout << ans.first << endl;
}