#include<bits/stdc++.h>
using namespace std;

long long tim=0;

void sol() {
    int n; cin>>n;
    vector<int> a(n);
    for(int &x:a) 
        cin>>x;
    using pii = pair<long long,int>;
    pii ans={2*n,1};

    for(int i=2;i<2*n&&i<=a[n-1]+1;i++) {
        long long sum=0;
        auto it=a.begin();
        do {
            sum++;
            it=lower_bound(it,a.end(),((*it)/i+1)*i);
        } while(it!=a.end());
        ans=min(ans,pii{sum*(i+1),i});
        if(((double)clock()-tim)/CLOCKS_PER_SEC>1.8) break;
    }
    
    cout<<ans.second<<'\n'<<ans.first<<'\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int T=1;
    while(T--)
        sol();

    return 0;
}