#include <bits/stdc++.h>
using namespace std;
const int MAX_SIZE = 1e6 + 10;
long long arr[MAX_SIZE];
long long prefix[MAX_SIZE];
long long coeff[MAX_SIZE];
void add(int l, int r, long long A, long long k) {
  prefix[l] += A;
  prefix[r + 1] -= k * 1L * (r - l) + A;
  coeff[l + 1] += k;
  coeff[r + 1] -= k;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  memset(prefix, 0, sizeof(prefix));
  memset(coeff, 0, sizeof(coeff));
  for (int i = 0; i < n; i++) {
    if (arr[i] >= (i + 1)) {
      add(0, arr[i] - (i + 1), arr[i] - (i + 1), -1);
      add(arr[i] - i, n - (i + 1), 1, 1);
      add(n - i, n - 1, arr[i] - 1, -1);
    } else {
      add(0, n - (i + 1), (i + 1) - arr[i], 1);
      add(n - i, n - (i + 1) + arr[i], arr[i] - 1, -1);
      add(n - i + arr[i], n - 1, 1, 1);
    }
  }
  prefix[0] += coeff[0];
  for (int i = 1; i < n; i++) {
    coeff[i] += coeff[i - 1];
    prefix[i] += coeff[i];
  }
  for (int i = 1; i < n; i++) {
    prefix[i] += prefix[i - 1];
  }
  long long res = 1e12;
  long long index = n;
  for (int i = 0; i < n; i++) {
    if (prefix[i] < res) {
      index = i;
      res = prefix[i];
    }
  }
  cout << res << " " << index << endl;
  return 0;
}
