#include <bits/stdc++.h>
const long long oo = 2 * 1000 * 1000 * 1000;
const int _cnt = 1000 * 1000;
const int _p = 1000 * 1000 * 1000 + 7;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
using namespace std;
void file_put() {
  freopen("filename.in", "r", stdin);
  freopen("filename.out", "w", stdout);
}
int n, a[1000005], p, q = 0, ans0 = 0;
long long ans = 0, ans1 = 0, num[5000005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] -= i;
    num[(a[i] > 0) ? a[i] : 0]++;
    ans += abs(a[i]);
  }
  p = n;
  ans1 = ans;
  for (int i = 1; i <= n - 1; i++) {
    a[p] -= i - 1;
    num[(a[p] > 0) ? a[p] + q : 0]--;
    ans1 += (long long)2 * num[0] - (long long)2 * abs(a[p]);
    a[p] = n - 1 - abs(a[p]);
    num[0] += num[q + 1];
    q++;
    num[(a[p] > 0) ? a[p] + q : 0]++;
    p--;
    if (ans1 < ans) {
      ans = ans1;
      ans0 = i;
    }
  }
  printf("%I64d %d\n", ans, ans0);
  return 0;
}
