#include <bits/stdc++.h>
using namespace std;
const int N = 1000002;
int n, p[N], sign[N];
long long curr;
vector<vector<int> > flips(N), add(N);
int move(int i, int d) {
  if (d < 1) return i;
  return (i + d) % n ? (i + d) % n : n;
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (int)(n); ++i) {
    scanf("%d", &p[i]);
    curr += i - p[i];
    if (p[i] == n)
      flips[0].push_back(i), add[n - i + 1].push_back(i);
    else {
      if (i <= p[i]) flips[0].push_back(i);
      int j = p[i] + 1 <= n ? p[i] + 1 : 1;
      int k = i <= j ? j - i : n - i + j;
      if (k) flips[k].push_back(i);
      int l = i == 1 ? 0 : n - i + 1;
      if (l and l != k) flips[l].push_back(i);
    }
  }
  int ans = -1, pls = n;
  long long dev = 1000000000000000000ll;
  for (int k = (0); k <= (int)(n - 1); ++k) {
    int changedPlus = 0, changedMinus = 0;
    for (int i : flips[k]) {
      if (sign[i])
        curr = curr - (p[i] - move(i, k - 1)) + (move(i, k) - p[i]),
        ++changedMinus;
      else
        curr = curr - (move(i, k - 1) - p[i]) + (p[i] - move(i, k)),
        ++changedPlus;
      sign[i] ^= 1;
    }
    for (int i : add[k]) curr += p[i];
    if (k) curr = curr + (pls - changedPlus) - (n - pls - changedMinus);
    pls = pls + changedMinus - changedPlus;
    if (curr < dev) dev = curr, ans = k;
  }
  cout << dev << " " << ans;
}
