#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, m, n) for (int i = m; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];

  auto f = [&](const ll x) {
    int kind = 1;
    rep(i, n - 1) {
      if (a[i] / x != a[i + 1] / x) kind++;
    }
    return (x + 1) * kind;
  };

  // ternary_search
  ll left = 1, right = n * 2;
  while (right - left > 10) {
    ll t1 = (2 * left + right) / 3;
    ll t2 = (left + 2 * right) / 3;
    if (f(t1) > f(t2))
      left = t1;
    else
      right = t2;
  }
  ll Min = 8e18, Mini;
  for (ll i = left; i <= right; i++) {
    ll fi = f(i);
    if (Min > f(i)) {
      Min = fi;
      Mini = i;
    }
  }

  cout << Mini << "\n";
  cout << Min << "\n";
}