#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1LL << 50;
const double eps = 1e-13;
long long sums[1000009];
long long l[1000009], r[1000009];
int d[1000009];
vector<int> p[4000009], p2[4000009];
int main() {
  int(n);
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) {
    scanf("%d", &(d[i]));
    p2[d[i] - 1 + (n - 1 - i) + 2000000].push_back(i);
    p[d[i] - n - i + 2000000].push_back(i);
  }
  int pv = 0, nv = 0;
  for (int i = 0; i < (n); ++i) {
    int c = d[i] - n;
    l[i + 1] = l[i] + abs(c) + pv - nv;
    if (c >= 0)
      pv++;
    else
      nv++;
    for (int j = 0; j < (((int)(p[-i + 2000000]).size())); ++j) {
      if (p[-i + 2000000][j] >= i) break;
      pv++;
      nv--;
    }
  }
  pv = 0, nv = 0;
  for (int i = n - 1; i >= 0; i--) {
    int c = d[i] - 1;
    r[i] = r[i + 1] + abs(c) + nv - pv;
    if (c <= 0)
      nv++;
    else
      pv++;
    for (int j = ((int)(p2[n - 1 - i + 2000000]).size()) - 1; j >= 0; j--) {
      if (p2[n - 1 - i + 2000000][j] <= i) break;
      nv++;
      pv--;
    }
  }
  long long best = 1LL << 60;
  int bi = 0;
  for (int i = (1); i < (n + 1); ++i) {
    long long cur = l[i] + r[i];
    if (cur < best) {
      best = cur;
      bi = n - i;
    }
  }
  printf("%I64d %d", best, bi % n);
}
