#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  dsu uf(n);
  VI left(n), right(n);
  rep(i, n) left[i] = right[i] = i;
  int ccnt = n;
  constexpr int INF = 1001001001;
  ll ans = INF;
  int ans_x = -1;
  VVI evs(2 * n + 1);
  rep(i, n - 1) {
    int dx = a[i + 1] - a[i];
    if (dx <= 2 * n) {
      evs[dx].emplace_back(i);
    }
  }
  for(int x = 1; x <= 2 * n; x++) {
    for(int i: evs[x]) {
      int li = uf.leader(i), lj = uf.leader(i + 1);
      int l = uf.merge(li, lj);
      ccnt--;
      left[l] = left[li];
      right[l] = right[lj];
    }
    if ((ll)ccnt * (x + 1) >= ans) continue;
    int cnt = 0;
    rep(i, n) {
      i = uf.leader(i);
      cnt += a[right[i]] / x - a[left[i]] / x + 1;
      i = right[i];
    }
    if (chmin(ans, ll(x + 1) * cnt)) {
      ans_x = x;
    }
  }
  cout << ans_x << '\n' << ans << '\n';
}