#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<1000000007>;

int main(){
    int N; cin >> N;
	vector<int> A(N); rep(i,N) cin >> A[i];
	int ans = N*2;
	int ansx = 1;
	for(int x=2; x<=N*2; x++){
		int p = 0;
		int sc = 0;
		while(p < N){
			int v = A[p] / x;
			sc += (x+1);
			p = lower_bound(A.begin(), A.end(), (v+1)*x) - A.begin();
			if(sc > ans) break;
		}
		if(sc < ans){ ans = sc; ansx = x; }
	}
	cout << ansx << endl;
	cout << ans << endl;
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;