#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0, icon = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') icon = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  return x * icon;
}
int _abs(int x) { return x < 0 ? -x : x; }
long long _min(long long a, long long b) { return a < b ? a : b; }
const int N = 2000000 + 233;
int a[N], num_s = 0, num_b = 0, c[N];
int ss[N], bb[N], n;
long long ans = 0, tmp, last;
int main() {
  n = read();
  for (int i = 0; i < n; i++) {
    a[i] = read();
    c[i] = a[i] - i - 1;
    if (c[i] > 0) {
      num_b++;
      bb[c[i]]++;
    }
    if (c[i] <= 0) {
      num_s++;
      ss[-c[i]]++;
    }
    ans += _abs(c[i]);
  }
  last = ans;
  int u = 0;
  for (int i = 1; i < n; i++) {
    tmp = last;
    tmp += num_s;
    tmp -= num_b;
    num_b -= bb[i];
    num_s += bb[i];
    c[n - i] -= i - 1;
    if (c[n - i] <= 0) {
      if (c[n - i] + n - 1 > 0) {
        int dd = c[n - i] + n - 1 - (_abs(c[n - i]) + 1);
        c[n - i] += n - 1;
        tmp += dd;
        num_b++;
        num_s--;
        bb[c[n - i] + i]++;
      } else
        tmp -= n;
    } else
      tmp += n - 2;
    if (ans > tmp) ans = tmp, u = i;
    last = tmp;
  }
  cout << ans << " " << u << endl;
  return 0;
}
