#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

#define int long long

vector<pair<long long, pair<long long, long long>>> quotient_ranges(long long N){
	vector<pair<long long, pair<long long, long long>>> ans;
	for (long long i = 1; i * i <= N; i++){
		ans.push_back(make_pair(N / i, make_pair(i, i)));
	}
	for (long long i = N / ((long long) sqrt(N) + 1); i >= 1; i--){
		ans.push_back(make_pair(i, make_pair(N / (i + 1) + 1, N / i)));
	}
	return ans;
}

void solve() {
    int n;
    cin >> n;
    vi a(n);
    FOR(n) cin >> a[i];

    //tuotient ranges

    vector<array<int, 3>> query;
    FOR(n) {
        vector<pair<int, pii>> p = quotient_ranges(a[i]);

        if(a[i] == 0) p.push_back(make_pair(0, make_pair(1, INF)));

        for(auto e : p) {
            query.push_back({0, e.first, e.second.first});
            query.push_back({1, e.first, e.second.second + 1});
        }
        
        // cout << a[i] << endl;
        // for(auto e : p) cout << e.first << " [" << e.second.first << ", " << e.second.second << "]" << endl;
    }

    vector<int> order(query.size());
    iota(all(order), 0);
    sort(all(order), [&](int i, int j) {
        if(query[i][2] != query[j][2]) return query[i][2] < query[j][2];
        return query[i][0] < query[j][0];
    });

    multiset<int> st;
    int kind = 0, ans = *max_element(all(a)) + 1, mn = *max_element(all(a)) + 2, cnt = 0;

    for(int i : order) {
        auto e = query[i];
        // cout << e[0] << " " << e[1] << " " << e[2] << endl;

        if(e[0] == 0) {
            if(st.find(e[1]) == st.end()) kind++;
            st.insert(e[1]);
            cnt++;
        }else {
            st.erase(st.find(e[1]));
            if(st.find(e[1]) == st.end()) kind--;
            cnt--;
        }

        if(cnt == n) {
            // assert(e[0] == 0);
            if(kind * (e[2]+1) < mn) {
                mn = kind * (e[2]+1);
                ans = e[2];
            }
        }
    }

    cout << ans << endl;
    cout << mn << endl;

    //0に注意したい
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}