#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

int n;
vector<ll> vs;

void read() {
  cin >> n;
  vs.resize(n);
  for (int i : range(n)) cin >> vs[i];
}

ll xmin = 0, fmin = 1LL << 60;
void update(ll x, ll f) {
  if (f < fmin) {
    dump(x << " " << f);
    fmin = f;
    xmin = x;
  }
}

void run() {
  const ll L = 100;
  const ll M = 10000000;
  // const ll L = 2;
  // const ll M = 1000;
  for (ll x = 1; x <= 100; ++x) {
    set<ll> st;
    for (int i : range(n)) st.insert(vs[i] / x);
    ll f = (x + 1) * st.size();
    update(x, f);
  }

  vector<int> seen(M / L + 10);
  for (ll x = 100; x * x <= 2 * M; ++x) {
    ll uni = 0;
    for (int i : range(n)) {
      ll div = vs[i] / x;
      if (seen[div] != x) seen[div] = x, uni++;
    }
    ll f = (x + 1) * uni;
    update(x, f);
  }

  cout << xmin << endl;
  cout << fmin << endl;
}

}

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  solver::run();
}